Abstract
We prove a new lower bound for the number of distinct languages accepted by binary symmetric difference automata ( ⊕ -NFAs), and compare that to Domaratzki's results (J. Automata Languages Combin. 7(4) (2002) 469) for (traditional) binary nondeterministic finite automata (NFAs). We also show that there are certain regular languages which are accepted by succinct ⊕ -NFAs, but for which no succinct traditional NFA exists.
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
