The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
23 views
Explain why L={(ab)^n a^k:n>k,k>=0} is not regular?
asked in Theory of Computation by Active (1.4k points) | 23 views
0
Because you have the relation between n and k
0
So if we have a relation between n and k than how can we say that it is Not regular.
+1
if relation exist then you have to compare n and k right?

you need memorization for comparing n and k but FA doesn't have memory, therefore it is not RL
0
@Shaik, Just little bit modification required.
Here you need infinite memorization (like by using a stack), but in FA we have only states to keep track of past information and FA has finite no. of states. :)
0
yes mam, it should be updated with your sentence,

Please log in or register to answer this question.



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

40,903 questions
47,555 answers
146,262 comments
62,304 users