|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc020401,
author = {Wolf G\"{o}hring},
title = {Minimal Initializing Word: A Contribution to
\v{C}ern\'{y}'s Conjecture},
journal = jalc,
year = 1997,
volume = 2,
number = 4,
pages = {209--226},
keywords = {finite state machine, initializable, directable,
synchronisable automaton,
minimal length of an initializing word,
\v{C}ern\'{y}'s conjecture},
abstract = {\v{C}ern\'{y}'s conjecture concerning the minimal length
of an initializing word of a finite automaton is treated for
a class of automata that lies ``between'' the general case
and the example given by \v{C}ern\'{y}. The automata
considered are called \v{C}ern\'{y}-like. Within this
context they are characterized by permutation groups. For
every finite automaton there exists a non-trivial
\v{C}ern\'{y}-like automaton as a monomorphic image of the
given one. For each number of states the conjecture is
proven for two subclasses of the \v{C}ern\'{y}-like automata.}
}