Transductions computed by PC-systems of monotone deterministic restarting automata

DOI10.1007/978-3-642-18098-9_18MaRDI QIDQ3073635zbMATH OpenOpenAlexFDO

Authors Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18098-9_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Restarting transducers, regular languages, and rational relations
• Characterizing the rational functions by restarting transducers
• Systems of parallel communicating restarting automata
• Restarting automata
• Monotonicity of restarting automata

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1394484 (Why is no real title available?)
• A hierarchy of monotone deterministic non-forgetting restarting automata
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Optimization of LR(k) parsers

Cited in

(4)

• A hierarchy of transducing observer systems
• Transducing by observing length-reducing and painter rules
• Characterizing the rational functions by restarting transducers
• Restarting transducers, regular languages, and rational relations

Describes a project that uses

Uses Software

• UCFL

This page was built for publication: Transductions computed by PC-systems of monotone deterministic restarting automata

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