RGPV 2008
Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}.
Ans. Some example strings = {1111,0110101, 001100110}
RGPV 2016
Prob 02. Design NFA that accepts all strings with at most 3 a’s.
Ans. Some example strings = {aaa, baba, a, ab}
RGPV 2014
Prob 03: Construct a finite automata for the language {0n | n mod 3 = 2, n>=0}
Ans. Some example strings = {00,00000,00000000}
RGPV 2016
Design a NFA for {cbabn | n>=0}
Ans. Some example strings = {cba, cbab, cbabb, cbabbb}
