280 views

1 Answer

1 votes
1 votes

The given language is L= {abc,aabccc,aaabbcccc,....}

The length of the string should be thrice of the number of a's.

As we use finite automata to check whether a given language is regular or not, we cannot count the number of alphabets (length of the string due to finite memory) . So the given language L is not regular.

Related questions

0 votes
0 votes
1 answer
4