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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.