Loading [MathJax]/jax/output/SVG/config.js
Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Zametki, 2011, Volume 90, Issue 3, Pages 422–430
DOI: https://doi.org/10.4213/mzm6191 (Mi mzm6191) 		 
This article is cited in 5 scientific papers (total in 5 papers)

Slowly Synchronizing Automata with Zero and Uncovering Sets

E. V. Pribavkina

Ural State University, Ekaterinburg
Full-text PDF (512 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm6191
Abstract: Using the combinatorial properties of uncovering sets in a free monoid, we construct a series of finite deterministic synchronizing automata with zero for which the shortest synchronizing word has length $n^2/4+n/2-1$, where $n$ is the number of states.
Keywords: free monoid, uncovering set, deterministic and nondeterministic automaton, synchronizing automaton (with zero), synchronizing word, maximal code.
Received: 28.08.2008
Revised: 21.12.2010
English version:
Mathematical Notes, 2011, Volume 90, Issue 3, Pages 411–417
DOI: https://doi.org/10.1134/S0001434611090094
Bibliographic databases:
Document Type: Article
UDC: 519.713.2
Language: Russian
Citation: E. V. Pribavkina, “Slowly Synchronizing Automata with Zero and Uncovering Sets”, Mat. Zametki, 90:3 (2011), 422–430; Math. Notes, 90:3 (2011), 411–417
Citation in format AMSBIB
\Bibitem{Pri11}
\by E.~V.~Pribavkina
\paper Slowly Synchronizing Automata with Zero and Uncovering Sets
\jour Mat. Zametki
\yr 2011
\vol 90
\issue 3
\pages 422--430
\mathnet{http://mi.mathnet.ru/mzm6191}
\crossref{https://doi.org/10.4213/mzm6191}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2868370}
\transl
\jour Math. Notes
\yr 2011
\vol 90
\issue 3
\pages 411--417
\crossref{https://doi.org/10.1134/S0001434611090094}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000296476500009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80155149509}
Linking options:
  • https://www.mathnet.ru/eng/mzm6191
  • https://doi.org/10.4213/mzm6191
  • https://www.mathnet.ru/eng/mzm/v90/i3/p422
    • This publication is cited in the following 5 articles:
    1. M. V. Volkov, “Synchronization of finite automata”, Russian Math. Surveys, 77:5 (2022), 819–891  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi
    2. Boccuto A., Carpi A., “On the Length of Uncompletable Words in Unambiguous Automata”, Rairo-Theor. Inform. Appl., 53:3-4 (2020), 115–123  crossref  mathscinet  isi
    3. Andrew Ryzhikov, Lecture Notes in Computer Science, 11682, Combinatorics on Words, 2019, 299  crossref
    4. Vladimir V. Gusev, Elena V. Pribavkina, Lecture Notes in Computer Science, 11682, Combinatorics on Words, 2019, 207  crossref
    5. Singh Sh.N., Krishna K.V., “On Syntactic Complexity of Circular Semi-Flower Automata”, Implementation and Application of Automata, Ciaa 2018, Lecture Notes in Computer Science, 10977, ed. Campeanu C., Springer International Publishing Ag, 2018, 312–323  crossref  mathscinet  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:458
    Full-text PDF :223
    References:68
    First page:20
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025