276 views

1 Answer

0 votes
0 votes

In both the given regular expressions, we need to count the number of a's and number of b's to check the given conditions, which cannot be implemented by a DFA/NFA. So they are not regular languages and the Union of these two languages is also not regular.

We need to use PDA.

Related questions

0 votes
0 votes
1 answer
4