The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
30 views

L1={anbn where n>=1} 

L2={anbm where n,m>=1}

check whether these languages is regular or not?

asked in Theory of Computation by (71 points) | 30 views

1 Answer

+2 votes
L1 is not regular because it requires comparison..

L2 is regular because it does not require any comparison.
answered by Active (3.9k points)

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

47,139 questions
51,388 answers
178,060 comments
66,700 users