Descriptional Complexity of Ambiguity in Symmetric Difference NFAs
Lynette van Zijl, Jaco Geldenhuys · Zenodo (CERN European Organization for Nuclear Research) · 2011
Abstract: 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 nondeter-ministic finite automata such that the smallest equivalent deterministic finite automata have O(2n) states.