Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Journal of Automata, Languages and Combinatorics
Sorted dependency insertion grammars
Theoretical Computer Science - Algebraic methods in language processing
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
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
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Single-Path Restarting Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
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
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Hierarchical relaxations of the correctness preserving property for restarting automata
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
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
Δ-clearing restarting automata and CFL
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Characterizing the regular languages by nonforgetting restarting automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On nonforgetting restarting automata that are deterministic and/or monotone
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Monotone deterministic RL-Automata don't need auxiliary symbols
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
Restricting the use of auxiliary symbols for restarting automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Characterizing the rational functions by restarting transducers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Strictly deterministic CD-systems of restarting automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Lambda-Confluence is undecidable for clearing restarting automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |