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, 1992, Volume 4, Issue 4, Pages 41–55 (Mi dm761)  
This article is cited in 10 scientific papers (total in 10 papers)

A decidable case of a problem on the completeness of automaton functions

D. N. Babin
Full-text PDF (1324 kB) Citations (10)
Received: 17.07.1991
Bibliographic databases:
UDC: 519.95
Language: Russian
Citation: D. N. Babin, “A decidable case of a problem on the completeness of automaton functions”, Diskr. Mat., 4:4 (1992), 41–55
Citation in format AMSBIB
\Bibitem{Bab92}
\by D.~N.~Babin
\paper A~decidable case of a~problem on the completeness of automaton functions
\jour Diskr. Mat.
\yr 1992
\vol 4
\issue 4
\pages 41--55
\mathnet{http://mi.mathnet.ru/dm761}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1228983}
\zmath{https://zbmath.org/?q=an:0815.94025}
Linking options:
  • https://www.mathnet.ru/eng/dm761
  • https://www.mathnet.ru/eng/dm/v4/i4/p41
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:291
    Full-text PDF :131
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024