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
Contextual grammars and natural languages
Handbook of formal languages, vol. 2
Contextual grammars and formal languages
Handbook of formal languages, vol. 2
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
Journal of Symbolic Computation
On representing recursively enumerable languages by internal contextual languages
Theoretical Computer Science
Journal of the ACM (JACM)
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Lookahead hierarchies of restarting automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
A Framework for Studying Grammars
Proceedings on Mathematical Foundations of Computer Science
A Taxonomy of Forgetting Automata
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
On Restarting Automata with Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
An Insertion into the Chomsky Hierarchy?
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Different Types of Monotonicity for Restarting Automata
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Monotonic Rewriting Automata with a Restart Operation
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Regular Languages That Are Church-Rosser Congruential
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
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
McNaughton families of languages
Theoretical Computer Science
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata
Theoretical Computer Science
Degrees of non-monotonicity for restarting automata
Theoretical Computer Science
On determinism versus nondeterminism for restarting automata
Information and Computation
Succinct description of regular languages by weak restarting automata
Information and Computation
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Information and Computation
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Hierarchical relaxations of the correctness preserving property for restarting automata
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
On lexicalized well-behaved restarting automata that are monotone
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
On nonforgetting restarting automata that are deterministic and/or monotone
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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 the complexity of 2-monotone restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On left-monotone deterministic restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Learning analysis by reduction from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Restarting automata with structured output and functional generative description
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the gap-complexity of simple RL-Automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On formalization of word order properties
CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Strictly deterministic CD-systems of restarting automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
The restarting automaton, introduced by Jančar et al in 1995, is motivated by the so-called 'analysis by reduction, ' a technique from linguistics. By now there are many different models of restarting automata, and their investigation has proved very fruitful in that they offer an opportunity to study the influence of various kinds of resources on their expressive power. Here a survey on the various models and their properties is given, their relationships to the language classes of the Chomsky hierarchy are described, and some open problems are presented.