Theory of Computation - Old Questions
11. Define regular grammar. Show with suitable example that the language described by regular grammar are accepted by a finite automata.
8 marks
|
Asked in 2071