Descriptional complexity of ambiguity in symmetric difference NFAs

van Zijl L. ; Geldenhuys J. (2011)

Article

We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministic finite automata have O(2n) states. © J.UCS.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/16775
This item appears in the following collections: