Automata
Language, L = {anbm | n, m ≥1}, check whether this language is regular or not
As we can see that there is a pattern in the language and FA can be generated so we are good to say that
Yes, this is a regular language.
Below is the DFA for above question:

And also powers of 'a' and 'b' are not related so from that point of view we can state that it is a regular language.
Click here to know how the above DFA is working



Quantitative Aptitude
Reasoning
Programming
Interview