Question: Decide whether the language, ={0 1 ,,1} is regular over the alphabet {0, 1}. Construct a DFA/NFA to prove it is regular else give a
Decide whether the language, ={0 1 ,,1} is regular over the alphabet {0, 1}. Construct a DFA/NFA to prove it is regular else give a formal proof it is non- regular based on pumping lemma.
Decide whether the language, ={(0 1)(01)|=2} is regular over the alphabet {0,1}. Construct a DFA/NFA to prove it is regular else give a formal proof it is non-regular based on pumping lemma.
Give the Regular Expression for the language recognized by the given DFA:
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
