Clearing Restarting Automata

Authors:
Peter Černo;František Mráz
Affiliations:
Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Malostranské nám. 25, 118 00 PRAHA 1, Czech Republic. petercerno@gmail.com;(Correspd.) Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Malostranské nám. 25, 118 00 PRAHA 1, Czech Republic. mraz@ksvi.ms.mff.cuni.cz
Venue:
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Year:
2010

Citing 11
Cited 3

Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
Marcus Contextual Grammars

Marcus Contextual Grammars
Associative language descriptions

Theoretical 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)
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Deleting string rewriting systems preserve regularity

Theoretical Computer Science - Developments in language theory
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Modeling syntax of free word-order languages: dependency analysis by reduction

TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
Learning analysis by reduction from positive data

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Δ-clearing restarting automata and CFL

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
Lambda-Confluence is undecidable for clearing restarting automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restarting automata were introduced as a model for analysis by reduction, which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automata with a very simple definition but simultaneously with interesting properties with respect to their possible applications. The new model can be learned very efficiently from positive examples and its stronger version can be used to learn effectively a large class of languages. We relate the class of languages recognized by clearing restarting automata to the Chomsky hierarchy.