Different Types of Monotonicity for Restarting Automata

Authors:
Petr Jancar;Frantisek Mráz;Martin Plátek;Jörg Vogel
Affiliations:
-;-;-;-
Venue:
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1998

Citing 0
Cited 6

Context-free languages can be accepted with absolutely no space overhead

Information and Computation
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Monotonicity of restarting automata

Journal of Automata, Languages and Combinatorics
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
On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

Abstract