A class of multitape automata with a decidable equivalence problem

MaRDI QIDQ794436zbMATHFDO

Authors Efim Kinber

Publication date 1983

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

decidabilitymulti-tape automataequivalence problemsone-way automatatwo-tape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Equivalence of two-dimensional multitape automata
• The equivalence problem of multidimensional multitape automata
• Revisiting the equivalence problem for finite multitape automata
• scientific article; zbMATH DE number 4037263
• The equivalence problem of multitape finite automata

Cited in

(17)

• Revisiting the equivalence problem for finite multitape automata
• Minimality and deadlockness of multitape automata
• HDTOL matching of computations of multitape automata
• Implementation and Application of Automata
• A new approach to solving equivalence problem
• On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
• LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES
• Equivalence of two-dimensional multitape automata
• scientific article; zbMATH DE number 4037263 (Why is no real title available?)
• Multi-tape Automata with Symbol Classes
• scientific article; zbMATH DE number 4100618 (Why is no real title available?)
• On the equivalence problem for deterministic multitape automata and transducers
• Loops in automata and HDTOL relations
• The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
• The equivalence problem of multidimensional multitape automata
• Complete system of equivalent transformations for multitape automata
• Formalization of the concept of multitape automaton

This page was built for publication: A class of multitape automata with a decidable equivalence problem

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