What is the complement of the language $L = (0+1) \cdot 01$?
The complement of L = {w | w ends with 01} over {0,1}* is the set of all strings over {0,1}* that do NOT end with 01.
A Mealy machine differs from a Moore machine because in a Mealy machine:
Mealy machine outputs are associated with transitions (state + input), whereas Moore machine outputs are associated with states.
Converting a Moore machine with k states to an equivalent Mealy machine results in a Mealy machine with:
Every Moore machine can be converted to an equivalent Mealy machine with the exact same number of states k.
The language $L = {w$ in {a, b}* | $w = w^R$ and |w| <= 5} is:
Since |w| <= 5, L contains only a finite set of strings. Every finite language is Regular.
The pumping constant p for $L = a \cdot b*$ is:
A valid pumping length for $L = a \cdot b*$ is $p = 1$. For any string in L of length at least 1, a decomposition with |xy| <= 1 places y in the initial symbol block, and pumping y preserves the form a*b*.