edited by
332 views

1 Answer

Position:
Show:

Related questions

0 0 votes
0 0 answers
485
485 views
Dknights asked Jan 16, 2025
485 views
Can someone help in the below language is this regular, how to prove it @Deepak Poonia sir @Shaik Masthan sirNumber of 0s and 1s are equal and in each prefix of w number ...
0 0 votes
1 1 answer
201
201 views
Dknights asked Nov 15, 2024
201 views
Start symbol generating ε. (e.g.; S- ε)and also written Any Context-free Grammar without ε in its language has an equivalent CNF.source - https://www.geeksforgeeks.org/co...
0 0 votes
2 2 answers
665
665 views
Dknights asked Dec 23, 2023
665 views
MIN DFA of {w: w contains an even number of 0s and exactly two 1s} MIN DFA of {w: w contains an even number of 0s or exactly two 1s} ex 111 is valid
0 0 votes
1 answers 1 answer
1.4k
1.4k views
Sunnidhya Roy asked Dec 12, 2022
1,355 views
L = {0^n 1^2n 0^n+m , n,m>=0}Is this Language CFL or non CFL?According to mewe can write this as 0^n 1^n 1^n 0^n 0^mThen we will keep on pushing 0’s and as and when we ge...