Converting Self-verifying Automata into Deterministic Automata

DOI10.1007/978-3-642-00982-2_39zbMath1234.68214OpenAlexW1569273857WikidataQ61677517 ScholiaQ61677517MaRDI QIDQ3618603

Giovanni Pighizzini, Galina Jirásková

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Pairs of complementary unary languages with ``balanced nondeterministic automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata and unary languages
• Complementing unary nondeterministic automata
• On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
• Nondeterministic Communication with a Limited Number of Advice Bits
• An upper bound for transforming self-verifying automata into deterministic ones
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• On cliques in graphs

This page was built for publication: Converting Self-verifying Automata into Deterministic Automata