Are there any works that study the relationship between Boolean functions and the size of the minimal DFAs required to represent those Boolean functions? Boolean functions refer to the usual definition, i.e., functions of the form $f: \{ 0, 1\}^n \rightarrow \{0, 1\}$. The DFA representing a Boolean function $f$ only accepts strings $x \in \{ 0, 1\}^n$ of length exactly $n$ for which $f(x) =1$. Hence, this primarily concerns the class of acyclic DFAs which only accept strings $X \subseteq \{0, 1\}^n$.
The kind of questions I am interested to understand are the following,
- For any k-term DNF, is there a DFA of size poly(n, k) which can represent the DNF? In other words, is anything known about the relationship between the size of DNFs and the size of DFAs required to represent it?
- If there is a Boolean formula over $n$ variables of size polynomial in $n$, then does it imply that there exists an (acyclic) DFA which can represent the same function where the number of states in the DFA is bounded by polynomial in $n$?
- Is there any class $C$ of Boolean functions such that $|C| = 2^{p(n)}$ for which the size of minimal DFAs required to represent $c \in C$ has exponential number of states ($\Omega(2^{n})$) ?