Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata

DOI10.1007/978-3-642-18098-9_18zbMath1297.68138OpenAlexW1535171476MaRDI QIDQ3073635

Friedrich Otto, Norbert Hundeshagen, 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)

Related Items (1)

Restarting transducers, regular languages, and rational relations

Uses Software

• Unnamed Item

Cites Work

• A hierarchy of monotone deterministic non-forgetting restarting automata
• Optimization of LR(k) parsers
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Unnamed Item
• Unnamed Item

This page was built for publication: Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata