Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Diskretnaya Matematika, 2005, Volume 17, Issue 1, Pages 68–72
DOI: https://doi.org/10.4213/dm88
(Mi dm88)
 

Externally periodic automata

A. V. Babash
References:
Abstract: We describe the automata which transfer any periodic input sequence into a periodic output sequence. We suggest an algorithm for checking whether a given automaton has this property and give upper bounds for the complexity of the algorithm.
Received: 05.06.2003
English version:
Discrete Mathematics and Applications, 2005, Volume 15, Issue 1, Pages 59–62
DOI: https://doi.org/10.1515/1569392053310355
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Babash, “Externally periodic automata”, Diskr. Mat., 17:1 (2005), 68–72; Discrete Math. Appl., 15:1 (2005), 59–62
Citation in format AMSBIB
\Bibitem{Bab05}
\by A.~V.~Babash
\paper Externally periodic automata
\jour Diskr. Mat.
\yr 2005
\vol 17
\issue 1
\pages 68--72
\mathnet{http://mi.mathnet.ru/dm88}
\crossref{https://doi.org/10.4213/dm88}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2164524}
\zmath{https://zbmath.org/?q=an:1102.68053}
\elib{https://elibrary.ru/item.asp?id=9135413}
\transl
\jour Discrete Math. Appl.
\yr 2005
\vol 15
\issue 1
\pages 59--62
\crossref{https://doi.org/10.1515/1569392053310355}
Linking options:
  • https://www.mathnet.ru/eng/dm88
  • https://doi.org/10.4213/dm88
  • https://www.mathnet.ru/eng/dm/v17/i1/p68
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:414
    Full-text PDF :245
    References:58
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024