By using n-grams for grammar induction one addresses the two parts in one go.
the use of n-grams implies that the solution will be searched for in the class of probabilistic regular languages, since n-grams induce probabilistic automata and, consequently, probabilistic regular languages.