Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2016, Number 4, Pages 12–17 (Mi vmumm161)  
This article is cited in 2 scientific papers (total in 2 papers)

Mathematics

Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states

L. N. Sysoeva

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (330 kB) Citations (2)
References:
PDF
HTML
Abstract: The problem of realization of Boolean functions by initial Boolean automata with two constant states and $n$ inputs is considered. Initial Boolean automaton with two constant states and $n$ inputs is an initial automaton with output such that in all states output functions are $n$-ary constant Boolean functions $0$ or $1$. The maximum cardinality of set of $n$-ary Boolean functions where $n > 1$ realized by an initial Boolean automaton with two constant states and $n$ inputs is obtained.
Key words: Boolean function, initial automaton, realization of Boolean functions.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00598
Received: 10.06.2015
English version:
Moscow University Mathematics Bulletin, 2016, Volume 71, Issue 4, Pages 140–145
DOI: https://doi.org/10.3103/S0027132216040021
Bibliographic databases:
Document Type: Article
UDC: 519.716.32
Language: Russian
Citation: L. N. Sysoeva, “Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2016, no. 4, 12–17; Moscow University Mathematics Bulletin, 71:4 (2016), 140–145
Citation in format AMSBIB
\Bibitem{Sys16}
\by L.~N.~Sysoeva
\paper Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2016
\issue 4
\pages 12--17
\mathnet{http://mi.mathnet.ru/vmumm161}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3637742}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2016
\vol 71
\issue 4
\pages 140--145
\crossref{https://doi.org/10.3103/S0027132216040021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000393855900002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84992417369}
Linking options:
  • https://www.mathnet.ru/eng/vmumm161
  • https://www.mathnet.ru/eng/vmumm/y2016/i4/p12
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025