Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
    
    
  
  
  
      
      
      
        
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2017), pp. 19-28
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The problem of realization of Boolean functions by initial Boolean automata with constant states and $n$ inputs is considered. Initial Boolean automaton with 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 exact value of the maximum number of $n$-ary Boolean functions, where $n > 1$, realized by an initial Boolean automaton with three constant states and $n$ inputs is obtained.
			
            
            
            
          
        
      @article{VMUMM_2017_2_a3,
     author = {L. N. Sysoeva},
     title = {Estimates for the number of {Boolean} functions realized by an initial {Boolean} automaton with three constant states},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {19--28},
     publisher = {mathdoc},
     number = {2},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a3/}
}
                      
                      
                    TY - JOUR AU - L. N. Sysoeva TI - Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2017 SP - 19 EP - 28 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a3/ LA - ru ID - VMUMM_2017_2_a3 ER -
%0 Journal Article %A L. N. Sysoeva %T Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states %J Vestnik Moskovskogo universiteta. Matematika, mehanika %D 2017 %P 19-28 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a3/ %G ru %F VMUMM_2017_2_a3
L. N. Sysoeva. Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2017), pp. 19-28. http://geodesic.mathdoc.fr/item/VMUMM_2017_2_a3/
