41 views
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not???
edited | 41 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