The equivalence problem for deterministic two-tape automata
From MaRDI portal
Publication:758956
DOI10.1016/S0022-0000(73)80045-5zbMath0271.94039MaRDI QIDQ758956
Publication date: 1973
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
The Equivalence Problem of Finite Substitutions on ab*c, with Applications, HDTOL matching of computations of multitape automata, Decidability of equivalence for deterministic synchronized tree automata, The equivalence problem of multitape finite automata, On the power of synchronization in parallel computations, Decision problems for pushdown threads, An algorithm deciding functional equivalence in a new class of program schemes, New techniques for proving the decidability of equivalence problem, 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, 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
Cites Work
