Restarting transducers, regular languages, and rational relations

DOI10.1007/S00224-014-9579-ZzbMath1339.68149OpenAlexW2089148617MaRDI QIDQ493655

Norbert Hundeshagen, Friedrich Otto

Publication date: 4 September 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9579-z

zbMATH Keywords

rational functionregular languagerestarting transducerrestarting automatonrational relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the descriptional complexity of stateless deterministic ordered restarting automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of monotone deterministic non-forgetting restarting automata
• Succinct description of regular languages by weak restarting automata
• Growing context-sensitive languages and Church-Rosser languages
• Characterizing the Rational Functions by Restarting Transducers
• Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Properties of Finite and Pushdown Transducers
• Church-Rosser Thue systems and formal languages
• Restarting automata
• Characterizing the Regular Languages by Nonforgetting Restarting Automata
• A general theory of translation
• A Note on Pushdown Store Automata and Regular Systems

This page was built for publication: Restarting transducers, regular languages, and rational relations