Genetic Algorithm for Synchronization

DOI10.1007/978-3-642-00982-2_58zbMath1234.68237MaRDI QIDQ3618622

Adam Roman

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_58

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Experimental Study of the Shortest Reset Word of Random Automata, Č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, On the Synchronizing Probability Function and the Triple Rendezvous Time, COMPAS - A Computing Package for Synchronization

Cites Work

• Synchronization
• Synchronizing finite automata with short reset words
• The range order of a product of i transformations from a finite full transformation semigroup
• Reset words for commutative and solvable automata
• Synchronizing finite automata on Eulerian digraphs.
• In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
• Reset Sequences for Monotonic Automata
• Synchronizing Automata with a Letter of Deficiency 2
• On two Combinatorial Problems Arising from Automata Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item