Tight Bounds for Determinizing and Simulating Unary Exclusive Nondeterministic Finite Automata

The descriptional and computational complexity of unary exclusive nondeterministic finite automata (XNFAs) is analyzed, showing tight bounds for determinization and simulation by nondeterministic and deterministic finite automata.