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

DOI10.1007/978-3-319-60134-2_10MaRDI QIDQ2399253zbMATH OpenOpenAlexFDO

Authors Stefan Gerdjikov, Stoyan Mihov, K. U. Schulz

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)

Recommendations

• Space-efficient bimachine construction based on the equalizer accumulation principle
• scientific article; zbMATH DE number 2143017
• Nondeterministic bimachines and rational relations with finite codomain
• On Weakly Ambiguous Finite Transducers
• Finite-state techniques. Automata, transducers and bimachines

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1773099 (Why is no real title available?)
• scientific article; zbMATH DE number 2143017 (Why is no real title available?)
• A remark on finite transducers
• Elements of automata theory. Translated from the French by Reuben Thomas
• Lexicographic decomposition of \(k\)-valued transducers
• Visibly pushdown transducers with look-ahead

Cited in

(4)

• Nondeterministic bimachines and rational relations with finite codomain
• Space-efficient bimachine construction based on the equalizer accumulation principle
• scientific article; zbMATH DE number 2143017 (Why is no real title available?)
• On Weakly Ambiguous Finite Transducers

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

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