Reset sequences for monotonic automata
SIAM Journal on Computing
An Introduction to Genetic Algorithms
An Introduction to Genetic Algorithms
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Information and Computation
Synchronizing monotonic automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Synchronizing automata with a letter of deficiency 2
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Experimental study of the shortest reset word of random automat
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Application of hierarchical classifier to minimal synchronizing word problem
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
| Hi-index | 0.00 |
We present a novel approach to the synchronization problem. It is a well-known fact that a problem of finding minimal (or: the shortest) synchronizing word (MSW) for a given synchronizing automaton is NP-complete. In this paper we present the genetic algorithm which tries, for a given automaton, to find possibly short word that synchronizes it. We use a modified version of a classical simple genetic algorithm (SGA).