669 views

1 Answer

1 1 vote
L+ = {a^2 , a^3 , a^4 ……….}

L* = {e , a^2 , a^3 , a^4 ,……..}
Position:
Show:

Related questions

3 3 votes
2 2 answers
1.1k
1.1k views
Jiten008 asked Oct 24, 2023
1,117 views
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
0 0 votes
1 1 answer
1.0k
1.0k views
Hirak asked May 22, 2019
1,047 views
is union of regular language and context free language always regular?
3 3 votes
1 1 answer
2.7k
2.7k views
logan1x asked May 10, 2019
2,740 views
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
1 1 vote
1 answers 1 answer
659
659 views
Divyanshum29 asked Jun 11, 2018
659 views
How to know that the language needs 1 stack or more than one stack in order to know about it is regular, context-free or not.exampleL1={$a^i b^j c^k│i<j<k$}L2={$a^i b^j c...