The inclusion problem for some classes of deterministic multitape automata

DOI10.1016/0304-3975(83)90077-4zbMath0523.68047OpenAlexW2039942445MaRDI QIDQ1056540

E. B. Kinber

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90077-4

zbMATH Keywords

decidabilityequivalence probleminclusion problemdeterministic one-way multitape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40)

Related Items

Loops in automata and HDTOL relations ⋮ On the equivalence problem for deterministic multitape automata and transducers ⋮ New techniques for proving the decidability of equivalence problem ⋮ Multiplicities: A deterministic view of nondeterminism ⋮ Decidability and syntactic control of interference ⋮ HDTOL matching of computations of multitape automata ⋮ The equivalence problem of multitape finite automata ⋮ Modelization of deterministic rational relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• On inclusion problem for deterministic multitape automata