scientific article; zbMATH DE number 3523154
From MaRDI portal
Publication:4101446
Cited in
(17)- Tinput-Driven Pushdown Automata
- Finite transducers and rational transductions
- Toeplitz corona and the Douglas property for free functions
- Multi-sequential word relations
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- On the representation of finite deterministic 2-tape automata
- New techniques for proving the decidability of equivalence problem
- Theoretical computer science: computational complexity
- Determinization of transducers over finite and infinite words.
- Multi-sequential word relations
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Equivalence checking problem for finite state transducers over semigroups
- Extended symbolic finite automata and transducers
- Unambiguity in automata theory
- A unified framework for disambiguating finite transductions
- On the Decidability of the Equivalence for k-Valued Transducers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101446)
