Genetic Algorithm for Synchronization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- On two Combinatorial Problems Arising from Automata Theory
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Synchronization
- Synchronization and stability of finite automata
- Synchronizing Automata with a Letter of Deficiency 2
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing finite automata with short reset words
- The range order of a product of i transformations from a finite full transformation semigroup
Cited in
(6)- Experimental study of the shortest reset word of random automata
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- Černý's conjecture and the road colouring problem
- A multi-parameter analysis of hard problems on deterministic finite automata
- Computing the shortest reset words of synchronizing automata
- COMPAS -- a computing package for synchronization
This page was built for publication: Genetic Algorithm for Synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618622)