0 votes 0 votes Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not??? Theory of Computation theory-of-computation dcfl + – saumya mishra asked Aug 3, 2018 edited Aug 3, 2018 by srestha saumya mishra 257 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shaik Masthan commented Aug 3, 2018 reply Follow Share comparing with a constant(5), therefore it is RL 0 votes 0 votes saumya mishra commented Aug 3, 2018 reply Follow Share Can you please explain sorry I am not getting what are you saying? 0 votes 0 votes Shaik Masthan commented Aug 3, 2018 reply Follow Share 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 3 votes 3 votes Please log in or register to add a comment.