Abstract
A result of Nicaud states that the number of distinct unary regular string languages recognized by minimal deterministic finite automata (DFAs) with n states is asymptotically equal to n2 n − 1. We consider the analogous question for symmetric difference automata (ℤ2-NFAs), and show that precisely 22n − 1 unary languages are recognized by n-state minimal ℤ2-NFAs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
