Shrinking restarting automata

Authors:
Tomasz Jurdziński;Friedrich Otto
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland;Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 10
Cited 3

Membership for growing context-sensitive grammars is polynomial

Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
String-rewriting systems

String-rewriting systems
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
On Growing Context-Sensitive Languages

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Finite-Change Automata

Proceedings of the 4th GI-Conference on Theoretical Computer Science
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory

On determinism versus nondeterminism for restarting automata

Information and Computation
Restarting Tree Automata

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Restarting automata are a restricted model of computation that is motivated by the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Here we consider a natural generalization of this model, called shrinking restarting automaton, where we require that there exists a weight function such that each rewrite step decreases the weight of the tape content with respect to that function. While it is still unknown whether the two most general types of restarting automata, the RWW-automaton and the RRWW-automaton, differ in their expressive power, we will see that the classes of languages accepted by the shrinking RWW-automaton and the shrinking RRWW-automaton coincide. Further, we will relate shrinking RRWW-automata to finite-change automata, which leads to new insights into the relationships between the classes of languages characterized by (shrinking) restarting automata and some well-known time and space complexity classes.