What is regular grammar in theory of computation?
Answers
Answered by
0
Theory of Computation – Regular Grammars. ... A right or left lineargrammar is called a regular grammar. Every regular expression can be represented by a regular grammar. As there is a finite automaton for everyregular expression we can generate a finite automaton for the regular grammar.
Similar questions
Chemistry,
7 months ago
Physics,
7 months ago
Physics,
7 months ago
Business Studies,
1 year ago
History,
1 year ago