Growing context-sensitive languages and Church-Rosser languages
Information and Computation
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Two-Way Restarting Automata and J-Monotonicity
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Information and Computation
Journal of Automata, Languages and Combinatorics
On the Complexity of 2-Monotone Restarting Automata
Theory of Computing Systems
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Correctness preservation and complexity of simple RL-automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Modeling syntax of free word-order languages: dependency analysis by reduction
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
On left-monotone deterministic restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On lexicalized well-behaved restarting automata that are monotone
DLT'10 Proceedings of the 14th international conference on Developments in language theory
| Hi-index | 0.00 |
A restarting automaton processes a given word by executing a sequence of local simplifications until a simple word is obtained that the automaton then accepts. Such a computation is expressed as a sequence of cycles. A nondeterministic restarting automaton M is called correctness preserving, if, for each cycle u@?"M^cv, the string v belongs to the characteristic language L"C(M) of M, if the string u does. Our first result states that for each type of restarting automaton X@?{R,RW,RWW,RL,RLW,RLWW}, if M is a nondeterministic X-automaton that is correctness preserving, then there exists a deterministic X-automaton M"1 such that the characteristic languages L"C(M"1) and L"C(M) coincide. When a restarting automaton M executes a cycle that transforms a string from the language L"C(M) into a string not belonging to L"C(M), then this can be interpreted as an error of M. By counting the number of cycles it may take M to detect this error, we obtain a measure for the influence that errors have on computations. Accordingly, this measure is called error detection distance. It turns out, however, that an X-automaton with bounded error detection distance is equivalent to a correctness preserving X-automaton, and therewith to a deterministic X-automaton. This means that nondeterminism increases the expressive power of X-automata only in combination with an unbounded error detection distance.