VOLUME 2 1997 NUMBER 4
Minimal Initializing Word: A Contribution to Černý's Conjecture
Wolf Göhring
Pages 209–226



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-1997-209,
  author  = {Wolf G{\"{o}}hring},
  title   = {Minimal Initializing Word: A Contribution to {\v{C}}ern{\'{y}}'s Conjecture},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {2},
  number  = {4},
  pages   = {209--226},
  year    = {1997},
  url     = {https://doi.org/10.25596/jalc-1997-209},
  doi     = {10.25596/jalc-1997-209}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: finite state machine, initializable, directable, synchronisable automaton, minimal length of an initializing word, Černý's conjecture
DOI: 10.25596/jalc-1997-209