A simple method for building bimachines from functional finite-state transducers

DOI10.1007/978-3-319-60134-2_10zbMath1489.68126OpenAlexW2619803670MaRDI QIDQ2399253

Klaus U. Schulz, Stefan Gerdjikov, Stoyan Mihov

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_10

zbMATH Keywords

rational functionstransducersbimachines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (1)

Space-efficient bimachine construction based on the equalizer accumulation principle

Cites Work

• Lexicographic decomposition of \(k\)-valued transducers
• Visibly Pushdown Transducers with Look-Ahead
• A remark on finite transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple method for building bimachines from functional finite-state transducers