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

DOI10.1007/978-3-319-60134-2_10zbMATH Open1489.68126OpenAlexW2619803670MaRDI QIDQ2399253FDOQ2399253

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

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

zbMATH Keywords

rational functionstransducersbimachines

Mathematics Subject Classification ID

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

Cites Work

• Elements of automata theory. Translated from the French by Reuben Thomas
• Lexicographic decomposition of \(k\)-valued transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Visibly pushdown transducers with look-ahead
• A remark on finite transducers
• Title not available (Why is that?)

Cited In (4)

• Nondeterministic bimachines and rational relations with finite codomain
• Space-efficient bimachine construction based on the equalizer accumulation principle
• Title not available (Why is that?)
• 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)