edited by
579 views
0 votes
0 votes

Is L={1n0n0m | m+n>100} a regular language? 

edited by

1 Answer

1 votes
1 votes
language which require comparison or storing of value is not regular.

its not regular as it require comparison for equality check between 1^n0^n

here no of 1's should be less than or equal to no of 0's which require comparison.

if the condition is m+n<100 in that case this will become finite hence regular.

Related questions

1 votes
1 votes
2 answers
2