论文信息 - Composition sequences for functions over a finite domain

Composition sequences for functions over a finite domain

Diverse problems ranging from many-valued logics to finite automata can be expressed as questions concerning compositions of functions over a finite domain. We develop a theory dealing with the depth and complete depth of such functions. Interconnections with synchronizable finite automata are also discussed. Many of the very basic problems turn out to be NP-hard. Also several open problems are pointed out.

Arto Salomaa | A. Salomaa

[1] Sophie Piccard,et al. Sur les Bases du Groupe Symetrique et les Couples de Substitutions qui Engendrent un Groupe Regulier , 1947 .

[2] Jean-Éric Pin. Sur les mots synthronisants dans un automate fini , 1978, J. Inf. Process. Cybern..

[3] Arto Salomaa. A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set , 1960, J. Symb. Log..

[4] I. K. Rystsov,et al. Reset Words for Commutative and Solvable Automata , 1997, Theor. Comput. Sci..

[5] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .

[6] Arto Salomaa,et al. Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring , 1999, Bull. EATCS.

[7] Ján Cerný,et al. On directable automata , 1971, Kybernetika (Praha).

[8] David Eppstein,et al. Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[9] Arto Salomaa. On basic groups for the set of functions over a finite domain , 1964 .

[10] Miroslav Ćirić,et al. DIRECTABLE AUTOMATA AND THEIR GENERALIZATIONS : A SURVEY , 2001 .

[11] Seymour Ginsburg,et al. On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine , 1958, JACM.