Equivalence checking problem for finite state transducers over semigroups
DOI10.1007/978-3-319-23021-4_19zbMATH Open1465.68187OpenAlexW2261362537MaRDI QIDQ2947161FDOQ2947161
Authors: Vladimir A. Zakharov 
Publication date: 22 September 2015
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_19
Recommendations
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- On equivalence and uniformisation problems for finite transducers
- Equivalence problems for transducers with a bounded number of states
- Equivalence of finite-valued symbolic finite transducers
- On some transducer equivalence problems for families of languages
Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- On the valuedness of finite transducers
- Symbolic finite state transducers: algorithms and applications
- On the Decidability of the Equivalence for k-Valued Transducers
- On the Decidability of Bounded Valuedness for Transducers
- On the decomposition of \(k\)-valued rational relations
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- A note on finite-valued and finitely ambiguous transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- The decidability of equivalence for deterministic finite transducers
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Title not available (Why is that?)
- Single-valued a-transducers
Cited In (8)
- Ferromagnetic Wire Memory
- Title not available (Why is that?)
- On Equivalence Checking of Nondeterministic Finite Automata
- On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Encoding musical procedures by sequential transducers
- Equivalence checking of prefix-free transducers and deterministic two-tape automata
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
This page was built for publication: Equivalence checking problem for finite state transducers over semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947161)
