Restarting transducers, regular languages, and rational relations

DOI10.1007/S00224-014-9579-ZzbMATH Open1339.68149OpenAlexW2089148617MaRDI QIDQ493655FDOQ493655

Authors: 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

Recommendations

• Characterizing the rational functions by restarting transducers
• Characterizing the regular languages by nonforgetting restarting automata
• Deterministic ordered restarting automata that compute functions
• On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
• Restarting automata

zbMATH Keywords

regular languagerational functionrestarting transducerrestarting automatonrational relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Growing context-sensitive languages and Church-Rosser languages
• Characterizing the rational functions by restarting transducers
• Properties of Finite and Pushdown Transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restarting automata
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Church-Rosser Thue systems and formal languages
• Transductions computed by PC-systems of monotone deterministic restarting automata
• Monotonicity of restarting automata
• Title not available (Why is that?)
• Characterizing the regular languages by nonforgetting restarting automata
• A general theory of translation
• A Note on Pushdown Store Automata and Regular Systems
• A hierarchy of monotone deterministic non-forgetting restarting automata
• Succinct description of regular languages by weak restarting automata

Cited In (7)

• Transductions computed by PC-systems of monotone deterministic restarting automata
• Characterizing the regular languages by nonforgetting restarting automata
• Transducing by observing length-reducing and painter rules
• Title not available (Why is that?)
• Characterizing the rational functions by restarting transducers
• On the descriptional complexity of stateless deterministic ordered restarting automata
• Deterministic ordered restarting automata that compute functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493655)