Monotonicity of restarting automata

Authors:
Petr Jancar;František Mráz;Martin Plátek;Jörg Vogel
Affiliations:
Center of Applied Cybernetics, Department of Computer Science, TU Ostrava, Ostrava, Czech Republic;Charles University, Department of Computer Science, Praha 1, Czech Republic;Charles University, Department of Computer Science, Praha 1, Czech Republic;Friedrich Schiller University, Computer Science Institute, Jena, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 10
Cited 3

A characterisation of deterministic context-free languages by means of right-congruences

Theoretical Computer Science
Contextual grammars and natural languages

Handbook of formal languages, vol. 2
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
Marcus Contextual Grammars

Marcus Contextual Grammars
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
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)
Different Types of Monotonicity for Restarting Automata

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
A grammar based approach to a grammar checking of free word order languages

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata

Information and Computation
Monotone deterministic RL-Automata don't need auxiliary symbols

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Characterizing the rational functions by restarting transducers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restarting automata constitute a special class of regulated length-reducing rewriting systems. In this paper, several versions of these automata and a (strict) monotonicity property imposed on their computations are considered. This yields three natural possibilities for defining when an automaton is (strictly) monotonic. A taxonomy of the relevant language classes is provided, and the decidability questions for the studied properties are answered.