Theory of Computation - Old Questions
Question Answer Details
11. Define regular grammar. Show with suitable example that the language described by regular grammar are accepted by a finite automata.
Answer
AI Generated Answer
AI is thinking...