Computational complexity of decision problems on self-verifying finite automata

DOI10.1007/978-3-319-98654-8_33MaRDI QIDQ1622990zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Sebastian Jakobi, Jozef jun. Jirásek

Publication date 22 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-98654-8_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Self-verifying finite automata and descriptional complexity
• Publication:4503922
• scientific article; zbMATH DE number 4041268
• scientific article; zbMATH DE number 4769
• Complexity of some problems from the theory of automata
• Descriptional and Computational Complexity of Finite Automata
• Exact complexity of problems of incompletely specified automata
• scientific article; zbMATH DE number 459363
• Decision Problems of Finite Automata Design and Related Arithmetics
• Intractability of decision problems for finite-memory automata

Cited in

(6)

• Self-verifying pushdown and queue automata
• Converting Self-verifying Automata into Deterministic Automata
• Exact complexity of problems of incompletely specified automata
• Self-verifying Cellular Automata
• Self-verifying finite automata and descriptional complexity
• Operations on Self-Verifying Finite Automata

This page was built for publication: Computational complexity of decision problems on self-verifying finite automata

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