0
$\begingroup$

If G is a context-free grammar such that it has the productions of the form

$$ X \rightarrow \alpha Y ,X \rightarrow \alpha $$

How can I show that L(G) is a regular language

  • 0
    Construct a DFA (or an NFA) recognizing it.2012-09-21

1 Answers 1