The equivalence problem for deterministic two-tape automata
From MaRDI portal
(Redirected from Publication:758956)
Cited in
(37)- The inclusion problem for some classes of deterministic multitape automata
- Rational equivalence relations
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- A note on decision problems for three-way two-dimensional finite automata
- Multiplicities: A deterministic view of nondeterminism
- The inclusion problem for simple languages
- Toward a mathematical theory of graph-generative systems and its applications
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
- Äquivalente Transformationen für Flußdiagramme
- Generalized \({}^{1,5}\) sequential machine maps
- Equivalence problems for transducers with a bounded number of states
- Synchronized tree automata
- Complete system of equivalent transformations for two-tape automata with disjoint loops
- Modelization of deterministic rational relations
- Reflections on the phenomenon of Aleksej Andreevich Lyapunov
- Minimality and deadlockness of multitape automata
- Solvability of equivalence problem for program machines
- Loops in automata and HDTOL relations
- Formalization of the concept of multitape automaton
- Recursive converters on a memory
- Equivalence of data flow schemas
- Sufficient conditions of equivalence of three-tape automata
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- Rational and Recognisable Power Series
- On the equivalence problem for deterministic multitape automata and transducers
- The Equivalence Problem of Finite Substitutions on ab*c, with Applications
- HDTOL matching of computations of multitape automata
- Solution of the generalized minimization problem for two-tape automata with one fixed tape
- Decidability of equivalence for deterministic synchronized tree automata
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata
- The equivalence problem of multitape finite automata
- On the power of synchronization in parallel computations
- The problem of equivalent transformations for homogeneous multitape automata
- Decision problems for pushdown threads
- Algorithm for establishing the equivalence of deterministic multitape automata
- An algorithm deciding functional equivalence in a new class of program schemes
- New techniques for proving the decidability of equivalence problem
This page was built for publication: The equivalence problem for deterministic two-tape automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758956)
