Question: Make a conjecture whether or not the language is regular. Then prove your conjecture. (f) L = {ab?: n > 100,1
Make a conjecture whether or not the language is regular. Then prove your conjecture.

(f) L = {a"b?: n > 100,1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
