A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Michael A. Harrison, Mario Schkolnick · Journal of the ACM · 1971
A new family of grammars is introduced.A grammatical characterization of the one-way nondeterministic stack languages is obtained.Characterizations of the languages accepted by nonerasing stack automata and by checking automata are also derived.