On binary ⊕-NFAs and succinct descriptions of regular languages

Lynette van Zijl
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.07.012">doi:10.1016/j.tcs.2004.07.012</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ldymdz7wjhd3be7sts5rtgprm">fatcat:3ldymdz7wjhd3be7sts5rtgprm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002152843/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b9a/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwNDAwNDM0Nw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/4d/544d1cc760d2da5a7b4311cd499509cfc8f92a07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.07.012"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>