The inclusion problem for some classes of deterministic multitape automata

DOI10.1016/0304-3975(83)90077-4MaRDI QIDQ1056540zbMATH OpenOpenAlexFDO

Authors Efim 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)

Cites work

• scientific article; zbMATH DE number 3730118 (Why is no real title available?)
• scientific article; zbMATH DE number 3757733 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• On inclusion problem for deterministic multitape automata
• The equivalence problem for deterministic two-tape automata

Cited in

(8)

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

This page was built for publication: The inclusion problem for some classes of deterministic multitape automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1056540)