scientific article; zbMATH DE number 4769

MaRDI QIDQ4712653zbMATH OpenFDO

Authors Arto Salomaa

Publication date 25 June 1992

zbMATH Keywords

equivalencefinite automataformal seriesPost Correspondence Problem

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Formal languages and automata (68Q45)

Recommendations

• A class of multitape automata with a decidable equivalence problem
• The equivalence problem of multitape finite automata
• Decidability of the equivalence problem for deterministic pushdown automata
• scientific article; zbMATH DE number 4037263

Cited in

(18)

• Decidability problems for unary output sequential transducers
• Intractability of decision problems for finite-memory automata
• Recognizability for automata
• Computational complexity of decision problems on self-verifying finite automata
• Undecidability and finite automata
• Automata for a decidable subset of duration calculus.
• Decision Problems for Finite Automata over Infinite Algebraic Structures
• scientific article; zbMATH DE number 4037263 (Why is no real title available?)
• scientific article; zbMATH DE number 4087032 (Why is no real title available?)
• scientific article; zbMATH DE number 4104395 (Why is no real title available?)
• scientific article; zbMATH DE number 459363 (Why is no real title available?)
• Deciding properties of integral relational automata
• On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
• scientific article; zbMATH DE number 3385562 (Why is no real title available?)
• Determinism and Nondeterminism in Finite Automata with Advice
• A criterion for the decidability of the A-completeness problem for definite automata
• The equivalence problem of multitape finite automata
• Decision problems for Turing machines

This page was built for publication:

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