Nondeterministic State Complexity of Positional Addition

Galina Jirásková, Alexander Okhotin
<span title="2009-07-30">2009</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively, then their sum s+t | s in S, t in T is represented by a nondeterministic automaton with 2mn+2m+2n+1 states. Moreover, this number of states is necessary in the worst case for all k>=9.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.4204/eptcs.3.14</a> <a target="_blank" rel="external noopener" href="">fatcat:mxhc7t7fjrhzzfur254kmja3hy</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / </button> </a>