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, 1990, Volume 2, Issue 1, Pages 72–79 (Mi dm837)  
This article is cited in 4 scientific papers (total in 4 papers)

Universal labyrinth traps for finite sets of automata

G. Kilibarda
Full-text PDF (1067 kB) Citations (4)
Received: 10.04.1989
Bibliographic databases:
UDC: 519.95
Language: Russian
Citation: G. Kilibarda, “Universal labyrinth traps for finite sets of automata”, Diskr. Mat., 2:1 (1990), 72–79
Citation in format AMSBIB
\Bibitem{Kil90}
\by G.~Kilibarda
\paper Universal labyrinth traps for finite sets of automata
\jour Diskr. Mat.
\yr 1990
\vol 2
\issue 1
\pages 72--79
\mathnet{http://mi.mathnet.ru/dm837}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1053505}
\zmath{https://zbmath.org/?q=an:0724.68058}
Linking options:
  • https://www.mathnet.ru/eng/dm837
  • https://www.mathnet.ru/eng/dm/v2/i1/p72
    • 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:298
    Full-text PDF :166
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024