Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states

DOI10.3103/S0027132217020048MaRDI QIDQ2399403zbMATH OpenFDO

Authors Lyubov' Nikolaevna Sysoeva

Publication date 23 August 2017

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

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

zbMATH Keywords

Boolean functionsinitial Boolean automata

Mathematics Subject Classification ID

Boolean functions (06E30) Formal languages and automata (68Q45)

Recommendations

• Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
• Quasiuniversal Boolean automaton with four constant states
• Statistical estimation of the structure of a finite population
• scientific article; zbMATH DE number 4176981
• scientific article; zbMATH DE number 647645

Cites work

• Certain properties of generalized \(\alpha\)-formulas

Cited in

(2)

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

This page was built for publication: Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399403)