Composition sequences for functions over a finite domain

Arto Salomaa
<span title="">2003</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;
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="https://doi.org/10.1016/s0304-3975(01)00227-4">doi:10.1016/s0304-3975(01)00227-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ysa7sqmxhjepnkphjjh4j6uy3q">fatcat:ysa7sqmxhjepnkphjjh4j6uy3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924174835/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/194/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMTAwMjI3NA%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/c5/68/c568e849a8e59b4abf04c9f6708fa0e1640167c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(01)00227-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>