The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
24 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 (27 points) | 24 views

1 Answer

+1 vote
L1 is not regular because it requires comparison..

L2 is regular because it does not require any comparison.
answered by Active (1.5k 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

36,157 questions
43,608 answers
123,961 comments
42,860 users