PL EN


Preferences help
enabled [disable] Abstract
Number of results
2010 | 19 |
Article title

Experiments on Synchronizing Automata

Authors
Content
Title variants
Languages of publication
PL
Abstracts
PL
This work is motivated by the ˇCern´y Conjecture – an old unsolved problem in the automata theory. We describe the results of the experiments on synchronizing automata, which have led us to two interesting results. The first one is that the size of an automaton alphabet may play an important role in the issue of synchronization: we have found a 5-state automaton over a 3-letter alphabet which attains the upper bound from the ˇCern´y Conjecture, while there is no such automaton (except ˇCern´y automaton C5) over a binary alphabet. The second result emerging from the experiments is a theorem describing the dependencies between the automaton structure S expressed in terms of the so-called merging system and the maximal length of all minimal synchronizing words for automata of type S.
Keywords
PL
 
Publisher
Year
Volume
19
Physical description
Dates
published
2010
online
08 - 07 - 2015
Contributors
author
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2083-8476-year-2010-volume-19-article-2999
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.