Operations on Self-Verifying Finite Automata
From MaRDI portal
Recommendations
- Operations on Unambiguous Finite Automata
- Operations on Unambiguous Finite Automata
- Self-verifying finite automata and descriptional complexity
- Operations on Boolean and alternating finite automata
- scientific article; zbMATH DE number 1452989
- Computational complexity of decision problems on self-verifying finite automata
- Self-correcting constructions of finite automata
- Operations on automata with all states final
- Operations on Permutation Automata
- Self-verifying pushdown and queue automata
Cited in
(8)- Performing regular operations with 1-limited automata
- Operations on Unambiguous Finite Automata
- Self-verifying finite automata and descriptional complexity
- Operations on Unambiguous Finite Automata
- scientific article; zbMATH DE number 1452989 (Why is no real title available?)
- Optimal simulation of self-verifying automata by deterministic automata
- Operational complexity: NFA-to-DFA trade-off
- Operational complexity: NFA-to-DFA trade-off
This page was built for publication: Operations on Self-Verifying Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194721)