Bihar STET – TOC Practice Test | Set 1

The Pumping Lemma provides a necessary property that all regular languages must satisfy; its violation via proof by contradiction proves a language is non-regular.

Mealy machine output is associated with transitions $\delta (q, a); Moore machine output$ is associated directly with state q.

Converting a Moore machine to a Mealy machine preserves the state set, yielding the exact same N states.

A Mealy state may produce different output symbols on different incoming edges; splitting states per output symbol yields up to M $\times |\Delta | states$ in Moore machine.

The expression (1* 0 1* 0 1*)* pairs '0's in couples of two with arbitrary '1's interspersed, generating strings with even '0' counts.