On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Journal of Automata, Languages and Combinatorics
Sorted dependency insertion grammars
Theoretical Computer Science - Algebraic methods in language processing
Iterated sequential transducers as language generating devices
Theoretical Computer Science
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
Monotonicity of restarting automata
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
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Characterizing the regular languages by nonforgetting restarting automata
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
Hi-index | 0.00 |