Skip to main content
Journal ArticleOPEN ACCESS

A Grammatical Characterization of One-Way Nondeterministic Stack Languages

Journal of the ACM (JACM) (1971) 18(2) 148-172
DOI: 10.1145/321637.321639
13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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. © 1971, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Harrison, M. A., & Schkolnick, M. (1971). A Grammatical Characterization of One-Way Nondeterministic Stack Languages. Journal of the ACM (JACM), 18(2), 148–172. https://doi.org/10.1145/321637.321639

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free