Composition sequences for functions over a finite domain

Theoretical Computer Science

Volumn 292, Issue 1, 2003, Pages 263-281

  Salomaa, Arto ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Length of compositions; Many valued truth functions; Synchronizable automata

Indexed keywords

FINITE AUTOMATA; FUNCTIONS; MANY VALUED LOGICS; PROBLEM SOLVING; SET THEORY; SYNCHRONIZATION;

SYNCHRONIZABLE AUTOMATA;

COMPUTER SCIENCE;

EID: 0037427764     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00227-4     Document Type: Article

References (15)

1. Bogdanović S., Imreh B., Ćirić M., Petković T. Directable automata and their generalizations. a survey Novi Sad J. Math. 29:1999.
2. Cerný J. Poznámka k homogénnym experimentom s konecnými automatmi. Mat. fyz. cas SAV. 14:1964;208-215.
3. Cerný J., Pirická A., Rosenauerová B. On directable automata. Kybernetika. 7:1971;289-298.
4. Epstein D. Reset sequences for monotonic automata. SIAM J. Comput. 19:1990;500-510.
5. Ginsburg S. On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. J. Assoc. Comput. Mach. 5:1958;266-280.
6. Mateescu A., Salomaa A. Many-valued truth functions, Cerný's conjecture and road coloring. EATCS Bull. 68:1999;134-150.
7. Moore E.F. Gedanken experiments on sequential machines. Shannon C.E., McCarthy J. Automata Studies. 1956;129-153 Princeton University Press, Princeton.
8. Piccard S. Sur les bases du groupe symétrique et les couples de substitutions qui engendrent un goupe régulier. 1946;Librairie Vuibert, Paris.
9. e cycle a l'Université Pierre et Marie Curie, Paris 6, 1978.
10. Pin J.-E. Sur les mots synchronisants dans un automate fini. Elektronische Informationsverarbeitung und Kybernetik EIK. 14:1978;297-303.
11. Rystsov I.K. Reset words for commutative and solvable automata. Theoret. Comput. Sci. 172:1997;273-279.
12. Salomaa A. A theorem concerning the composition of functions of several variables ranging over a finite set. J. Symbolic Logic. 25:1960;203-208.
13. Salomaa A. On the composition of functions of several variables ranging over a finite set. Ann. Univ. Turkuensis Ser. AI. 41:1960.
14. Salomaa A. On basic groups for the set of functions over a finite domain. Ann. Acad. Scient. Fennicae Ser. AI. 338:1963.
15. Vorobév N. On symmetric associative systems. Leningrad Gos. Ped. Inst. Uch. Zap. 89:1953;161-166. (in Russian).