Composition sequences and synchronizing automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1953272
- Generation of constants and synchronization of finite automata
- Between primitive and 2-transitive: synchronization and its friends
- Compositions over a finite domain: From completeness to synchronizable automata
- Synchronizing non-deterministic finite automata
Cites work
- A theorem concerning the composition of functions of several variables ranging over a finite set
- Composition sequences for functions over a finite domain.
- scientific article; zbMATH DE number 1346363 (Why is no real title available?)
- scientific article; zbMATH DE number 3099421 (Why is no real title available?)
- On a conjecture by Carpi and D'Alessandro
- On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
- Synchronizing automata with finitely many minimal synchronizing words
- The averaging trick and the Černý conjecture
Cited in
(8)- Composition sequences for functions over a finite domain.
- Between primitive and 2-transitive: synchronization and its friends
- scientific article; zbMATH DE number 1670469 (Why is no real title available?)
- Compositions over a finite domain: From completeness to synchronizable automata
- On synchronizing automata and uniform distribution
- scientific article; zbMATH DE number 1953272 (Why is no real title available?)
- Generation of constants and synchronization of finite automata
- Compositional synthesis of asynchronous automata
This page was built for publication: Composition sequences and synchronizing automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891329)