Clearing Restarting Automata

DOI10.3233/FI-2010-334zbMath1214.68190OpenAlexW1677011730MaRDI QIDQ3000289

František Mráz, Peter Černo

Publication date: 18 May 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-334

zbMATH Keywords

formal languagesgrammatical inferenceanalysis by reductionclearing restarting automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (7)

Regulated variants of limited context restarting automata ⋮ A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata ⋮ On the expressive power of stateless ordered restart-delete automata ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ On Restarting Automata with Window Size One ⋮ Two Results on Discontinuous Input Processing ⋮ Lambda-confluence for context rewriting systems

This page was built for publication: Clearing Restarting Automata