Question: 1) L ={ a n b m | | n - m | 3} is a regular language.(the difference between the number of a'sand b'sis
1)L ={ anbm||n - m|3}is a regular language.(the difference between the number of a'sand b'sis at least 3).
True or False?
2) A DFA has exactly one equivalent NFA.
True or False?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
