LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA

Research output: Contribution to journalArticle

6 Citations (Scopus)
Original languageEnglish
Pages (from-to)251-262
Number of pages12
JournalInternational Journal of Foundations of Computer Science
Volume24
Issue number2
DOIs
Publication statusPublished - Feb 2013

Keywords

  • Synchronizing automata
  • exponent of digraph
  • Cerny
  • conjecture
  • CERNY CONJECTURE
  • EXPONENTS
  • SEQUENCES
  • DIGRAPHS

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

WoS ResearchAreas Categories

  • Computer Science, Theory & Methods

Cite this