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


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

38,106 questions
45,610 answers
132,250 comments
49,239 users