Register

Internet Question

399 views
0 0 votes
Construct a Reduced Grammer equivalent to the grammer

S → aS/A/C
C → aCb
A → a
B → aa

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Self doubt - Seriali...Next → · Applied Test Series
← Previous in category · Internet QuestionNext in category → · Internet
Position:
Show:

Related questions

0 0 votes
1 1 answer
451
451 views
Biswajit Kumar asked Sep 13, 2023
451 views
Internet
Consider the following language definition:L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ ΣL isA. RegularB. Context-free but not regularC. Re...
0 0 votes
2 answers 2 answers
513
513 views
vrag asked Nov 12, 2021
513 views
Internet
Write the Regular expression using arden’s lemma
0 0 votes
3 3 answers
830
830 views
Mk15 asked Nov 2, 2021
830 views
Internet Question
Remove the Null ProductionsS → XYX → ZbY → bWZ → ABW → ZA → aA | bA | ΛB → Ba | Bb | Λ