Register

Recent questions tagged simplification

4.6k
views
0 answers
1 votes
Automata: Conversion from CFG to CNF
Convert the following context free grammar into Chomsky Normal Form:$S \rightarrow ASA | aB$A \rightarrow B | S$B \rightarrow b | \epsilon$Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?
User Avatar
2.7k
views
0 answers
1 votes
Automata: Number of Productions in the CFG
Consider the following context free grammar:$S \rightarrow ASA | aB$A \rightarrow B | S$B \rightarrow b | \epsilon$How many productions will be there in ... I am getting 12 productions. can someone please confirm if it's correct?
User Avatar
2.6k
views
0 answers
0 votes
CFG: Removal of Unit Productions
Remove unit productions from the following CFG:S0 --> SS --> ASA | aB | a | SA | AS | SA-->B | SB --> bSolution:if I replace S with its Right Side part, i ... bHow to remove this S from RHS, S->S or S0->S or A->S all are unit productions.
User Avatar
3.2k
views
0 answers
0 votes
Grammar Simplification
Consider the following grammar :S-> Aa / BB -> a / bCC -> a / epsilonThe number of productions in simplified CFG is_________.I am getting 3. As S -> Aa / a / b.
User Avatar
487
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 4 | Question: 36
Which of the following statements is/are CORRECT?$S_1$: Max term is a sum term which contains all the variables in either direct or complementary form.$S_2$: Min ... is correctonly $S_2$ is correctAll $S_1$, $S_2$ and $S_3$ are correct
User Avatar
10.8k
views
7 answers
2 votes
SIMPLIFICATION OF CFG
User Avatar
Page: