Composition Sequences and Synchronizing Automata

DOI10.1007/978-3-642-27654-5_31zbMath1263.68103OpenAlexW100355569MaRDI QIDQ2891329

Arto Salomaa

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_31

zbMATH Keywords

functional completenesssynchronizing automatonCerny's conjecture

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronizing automata with finitely many minimal synchronizing words
• Composition sequences for functions over a finite domain.
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• On a Conjecture by Carpi and D’Alessandro
• The Averaging Trick and the Černý Conjecture
• A theorem concerning the composition of functions of several variables ranging over a finite set

This page was built for publication: Composition Sequences and Synchronizing Automata