Abstract
We introduce restarting automata as two-way automata in order to obtain a more general model which is closer to our linguistic motivations. We study the notion of j-monotonicity to show the advantages of this model. We show that the j-monotonicity can be considered as a degree of non-context-freeness and that it is a robust notion due to the considered models of restarting automata. Some other aspects concerning power and applications of two-way restarting automata are mentioned.
Cite
CITATION STYLE
Plàtek, M. (2001). Two-way restarting automata and j-monotonicity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2234, pp. 316–325). Springer Verlag. https://doi.org/10.1007/3-540-45627-9_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
