Converting Self-verifying Automata into Deterministic Automata
From MaRDI portal
Recommendations
- Optimal simulation of self-verifying automata by deterministic automata
- Self-verifying finite automata and descriptional complexity
- An upper bound for transforming self-verifying automata into deterministic ones
- scientific article; zbMATH DE number 7444008
- Computational complexity of decision problems on self-verifying finite automata
Cites work
- An upper bound for transforming self-verifying automata into deterministic ones
- Complementing unary nondeterministic automata
- Descriptional complexity of machines with limited resources
- Finite automata and unary languages
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- Nondeterministic Communication with a Limited Number of Advice Bits
- On cliques in graphs
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Cited in
(5)- Pairs of complementary unary languages with ``balanced nondeterministic automata
- Self-verifying finite automata and descriptional complexity
- Self-verifying pushdown and queue automata
- An upper bound for transforming self-verifying automata into deterministic ones
- Optimal simulation of self-verifying automata by deterministic automata
This page was built for publication: Converting Self-verifying Automata into Deterministic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618603)
