Optimal simulation of self-verifying automata by deterministic automata
From MaRDI portal
Publication:553320
DOI10.1016/J.IC.2010.11.017zbMATH Open1217.68132DBLPjournals/iandc/JiraskovaP11OpenAlexW1978638999WikidataQ57380749 ScholiaQ57380749MaRDI QIDQ553320FDOQ553320
Authors: Galina Jirásková, Giovanni Pighizzini 
Publication date: 27 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.017
Recommendations
Cites Work
- On cliques in graphs
- Finite automata and unary languages
- Descriptional complexity of machines with limited resources
- Title not available (Why is that?)
- 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
- Pairs of complementary unary languages with ``balanced nondeterministic automata
- Title not available (Why is that?)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Complementing unary nondeterministic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondeterministic Communication with a Limited Number of Advice Bits
- An upper bound for transforming self-verifying automata into deterministic ones
Cited In (18)
- Reversal of binary regular languages
- Title not available (Why is that?)
- Self-verifying pushdown and queue automata
- An upper bound for transforming self-verifying automata into deterministic ones
- Converting Self-verifying Automata into Deterministic Automata
- Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
- Self-verifying Cellular Automata
- Descriptional complexity of the forever operator
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- Optimal state reductions of automata with partially specified behaviors
- Self-verifying finite automata and descriptional complexity
- Iterative arrays with self-verifying communication cell
- Unary Self-verifying Symmetric Difference Automata
- Title not available (Why is that?)
- Optimal simulations between unary automata
- Nondeterministic Moore automata and Brzozowski's algorithm
- Self-verifying cellular automata
- Iterative arrays with self-verifying communication cell
This page was built for publication: Optimal simulation of self-verifying automata by deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553320)
