The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
49 views
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not???
asked in Theory of Computation by Active (1.5k points)
edited by | 49 views
0
comparing with a constant(5), therefore it is RL
0
Can you please explain sorry  I am not getting what are you saying?
+3

What i am saying,

here you did not require to compare n,l and k

just you have to compare sum of (n,l and k) with 5

5 is constant not a variable, if it is a variable then you require infinite amount of memory.

But for a constant you did not require infinite amount of memory, you just required finite amount of memory.

therefore it is RL

NFA for the Language

L={anblak:n+l+k>50000000} is also a RL

Please log in or register to answer this question.

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
49,427 questions
53,610 answers
185,910 comments
70,885 users