2,106 views
2 votes
2 votes

-While Converting RLG to Finite Automata, how we are mentioning the productions such as A->b and C->a of the below grammar and how we decide the final state?. Please help

1 Answer

0 votes
0 votes
The productions

A->bA

A->b shows that A is final state

And same with C->aA/a

Related questions

1 votes
1 votes
1 answer
1
sushmita asked Sep 16, 2018
689 views
In converting right linear regular grammar to DFA how to determine the final states?Can anyone tell the procedure?
3 votes
3 votes
2 answers
2
0 votes
0 votes
2 answers
3
4 votes
4 votes
1 answer
4