edited by
257 views
0 votes
0 votes
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not???
edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
2
srestha asked Nov 26, 2018
544 views
$L_{1}=\left \{ 0^{m}.1^{n}.2^{m}.3^{n} \right |n,m>0\}$$L_{2}=\left \{ a^{i}.b^{j}.c^{k}.d^{l} \right |i+k=j+l\}$which one DCFL?Refrence :https://gateoverflow.in/15327/c...
0 votes
0 votes
0 answers
3
Na462 asked Sep 11, 2018
700 views
Consider the following languages :L1: {a bn a2n | n ≥ 0 }L2: { a a bn a3n | n ≥ 0 }Which of the following is true ?A. L1 U L2 is regularB. L1 U L2 is DCFLC. L1 inters...
2 votes
2 votes
3 answers
4