278 views

1 Answer

Position:
Show:

Related questions

1 1 vote
1 1 answer
1.4k
1.4k views
Garrett McClure asked Oct 14, 2017
1,418 views
Find a context-free grammar for the following language (with n ≥ 0, m ≥ 0):L = {anwwRbn : w ∈ {a, b} ∗ , n ≥ 1}.
1 1 vote
1 1 answer
2.5k
2.5k views
Garrett McClure asked Sep 14, 2017
2,522 views
Find an NFA with two states that accepts the following language:L = {an : n ≥ 1} ∪ {bmak : m ≥ 0, k ≥ 0}.
0 0 votes
1 1 answer
531
531 views
Deepak9000 asked Nov 27, 2023
531 views
Why is C is regular as it non regular as?Please help me with this confusion
1 1 vote
1 1 answer
1.2k
1.2k views
rahul sharma 5 asked Aug 5, 2017
1,202 views
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0AA->0 | SS