Ambiguity of unary symmetric difference NFAs

Authors:
Brink van der Merwe;Lynette van Zijl;Jaco Geldenhuys
Affiliations:
Department of Computer Science, Stellenbosch University, Matieland, South Africa;Department of Computer Science, Stellenbosch University, Matieland, South Africa;Department of Computer Science, Stellenbosch University, Matieland, South Africa
Venue:
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Year:
2011

Citing 9
Cited 1

Finite automata and unary languages

Theoretical Computer Science
Relating the type of ambiguity of finite automata to the succinctness of their representation

SIAM Journal on Computing
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

SIAM Journal on Computing
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Errata to: "finite automata and unary languages"

Theoretical Computer Science
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)
Unambiguous finite automata over a unary alphabet

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Pseudonoise sequences based on algebraic feedback shift registers

IEEE Transactions on Information Theory

Minimal DFA for symmetric difference NFA

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the finite automaton. In particular, for every n-state unary nondeterministic symmetric difference finite automaton, there is an equivalent finitely ambiguous n-state unary symmetric difference nondeterministic finite automaton. We also note other relevant ambiguity issues in the unary case, such as the ambiguity of k-deterministic finite automata.