Quasiuniversal Boolean automaton with four constant states

DOI10.3103/S0027132219060056zbMath1452.68109OpenAlexW3003727792MaRDI QIDQ785918

Lyubov' Nikolaevna Sysoeva

Publication date: 12 August 2020

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132219060056

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
• Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
• Unnamed Item
• Unnamed Item

This page was built for publication: Quasiuniversal Boolean automaton with four constant states