Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 4, Pages 44–56 (Mi da540)  
This article is cited in 4 scientific papers (total in 4 papers)

Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata

P. V. Martyugin

Ural State University
Full-text PDF (272 kB) Citations (4)
References:
PDF
HTML
Abstract: The notion of carefully synchronizing words for partial finite automata (PFA) is introduced. The careful synchronization of PFA is a natural generalization of the synchronization of the deterministic finite automata. Some lower bounds for the length of the shortest carefully synchronizing words are found for an automaton with a given number of states. It is proven that the maximal length of the shortest reset words for two- and three-letter automata grows faster than any polynomial in the number of states. Tabl. 1, illustr. 3, bibl. 11.
Keywords: automata, synchronization.
Received: 18.04.2008
Revised: 13.05.2008
Bibliographic databases:
UDC: 519.713.2
Language: Russian
Citation: P. V. Martyugin, “Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata”, Diskretn. Anal. Issled. Oper., 15:4 (2008), 44–56
Citation in format AMSBIB
\Bibitem{Mar08}
\by P.~V.~Martyugin
\paper Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 4
\pages 44--56
\mathnet{http://mi.mathnet.ru/da540}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2543599}
\zmath{https://zbmath.org/?q=an:1249.68103}
Linking options:
  • https://www.mathnet.ru/eng/da540
  • https://www.mathnet.ru/eng/da/v15/i4/p44
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:293
    Full-text PDF :125
    References:31
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024