Composition sequences for functions over a finite domain

Arto Salomaa
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Diverse problems ranging from many-valued logics to ÿnite automata can be expressed as questions concerning compositions of functions over a ÿnite domain. We develop a theory dealing with the depth and complete depth of such functions. Interconnections with synchronizable ÿnite automata are also discussed. Many of the very basic problems turn out to be NP-hard. Also several open problems are pointed out.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/s0304-3975(01)00227-4</a> <a target="_blank" rel="external noopener" href="">fatcat:ysa7sqmxhjepnkphjjh4j6uy3q</a> </span>
<a target="_blank" rel="noopener" href="" 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="" 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="external alternate icon"></i> </button> </a>