Register

Left linear regular grammar to machine

1,105 views
0 votes
0 votes

Can we directly convert a given Left linear regular grammar to machine ?

or

First convert Left linear regular grammar to Right linear regular grammar and then to machine .

http://scanftree.com/automata/conversion-of-left-linear-grammar-to-finite-automata

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Abbas Ahmad asked Nov 30, 2018
415 views
Self doubt about relation between regular and linear grammar
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regular b) G may or may not be regular c) something else
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regularb) G may or may not be regularc) something else
User Avatar
7 votes
7 votes
2 answers
2
pC asked Jul 23, 2016
6,631 views
Convert RE to Left Linear Grammer
How to convert a Regular Expression to Left Linear Grammar ? Eg : (0+1)*00(0+1)*
How to convert a Regular Expression to Left Linear Grammar ?Eg : (0+1)*00(0+1)*
User Avatar
1 votes
1 votes
1 answer
3
sushmita asked Sep 16, 2018
695 views
conversion of right linear grammar to DFA
In converting right linear regular grammar to DFA how to determine the final states? Can anyone tell the procedure?
In converting right linear regular grammar to DFA how to determine the final states?Can anyone tell the procedure?
User Avatar
3 votes
3 votes
2 answers
4
Tuhin Dutta asked Nov 22, 2017
2,381 views
Need help to draw a DFA from a Right Linear grammar
.............................................................. .
...............................................................
User Avatar
Link Copied!