Converting Self-verifying Automata into Deterministic Automata

Authors:
Galina Jirásková;Giovanni Pighizzini
Affiliations:
Mathematical Institute, Slovak Academy of Sciences, Košice, Slovakia 040 01;Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Milano, Italy I-20135
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 8
Cited 1

On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata

Information and Computation
On the state complexity of k-entry deterministic finite automata

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Nondeterministic Communication with a Limited Number of Advice Bits

SIAM Journal on Computing
Complementing unary nondeterministic automata

Theoretical Computer Science - Descriptional complexity of formal systems
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems

IBM Journal of Research and Development

Pairs of complementary unary languages with “balanced” nondeterministic automata

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self-verifying automata are a special variant of finite automata with a symmetric kind of nondeterminism. In this paper, we study the transformation of self-verifying automata into deterministic automata from a descriptional complexity point of view. The main result is the exact cost, in terms of the number of states, of such a simulation.