Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3

DOI10.3103/S0027132214030036zbMath1337.94112OpenAlexW1979880130MaRDI QIDQ2018028

Yanyan Li

Publication date: 24 March 2015

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

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

Mathematics Subject Classification ID

Boolean functions (06E30) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the synthesis and complexity of formulae with bounded depth of alternation
• Finite state languages