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, 2003, Volume 15, Issue 1, Pages 110–130
DOI: https://doi.org/10.4213/dm188 (Mi dm188) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part

D. N. Babin
Full-text PDF (1326 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm188
Abstract: We consider automaton bases with complete Boolean part. We construct an algorithm to test completeness of such bases and give upper bounds for its complexity.
Received: 11.10.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 1, Pages 63–84
DOI: https://doi.org/10.1515/156939203321669564
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: D. N. Babin, “Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part”, Diskr. Mat., 15:1 (2003), 110–130; Discrete Math. Appl., 13:1 (2003), 63–84
Citation in format AMSBIB
\Bibitem{Bab03}
\by D.~N.~Babin
\paper Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 1
\pages 110--130
\mathnet{http://mi.mathnet.ru/dm188}
\crossref{https://doi.org/10.4213/dm188}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1996748}
\zmath{https://zbmath.org/?q=an:1088.68630}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 1
\pages 63--84
\crossref{https://doi.org/10.1515/156939203321669564}
Linking options:
  • https://www.mathnet.ru/eng/dm188
  • https://doi.org/10.4213/dm188
  • https://www.mathnet.ru/eng/dm/v15/i1/p110
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:370
    Full-text PDF :205
    References:43
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024