Deterministic ordered restarting automata that compute functions

DOI10.1007/978-3-319-21500-6_32MaRDI QIDQ3451119zbMATH OpenOpenAlexFDO

Authors Friedrich Otto, Kent Kwee

Publication date 10 November 2015

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21500-6_32

zbMATH Keywords

descriptional complexityordered restarting automatonrational function

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Characterizing the rational functions by restarting transducers
• On the descriptional complexity of stateless deterministic ordered restarting automata
• Restarting transducers, regular languages, and rational relations
• On the descriptional complexity of deterministic ordered restarting automata
• Some classes of rational functions for pictures

Cites work

• Characterizing the rational functions by restarting transducers
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• On Relations Defined by Generalized Finite Automata
• On some decision problems for stateless deterministic ordered restarting automata
• On the descriptional complexity of deterministic ordered restarting automata
• Ordered restarting automata for picture languages
• Properties of Finite and Pushdown Transducers
• Reversible Ordered Restarting Automata
• Weight-reducing Hennie machines and their descriptional complexity

Cited in

(5)

• On the descriptional complexity of stateless deterministic ordered restarting automata
• Reversible Ordered Restarting Automata
• Characterizing the rational functions by restarting transducers
• Some classes of rational functions for pictures
• Restarting transducers, regular languages, and rational relations

This page was built for publication: Deterministic ordered restarting automata that compute functions

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