The structure of context-free grammatical families

DOI10.1016/S0022-0000(77)80030-5zbMATH Open0366.68052OpenAlexW2018473358MaRDI QIDQ1241983FDOQ1241983

Authors: Seymour Ginsburg, Armin B. Cremers, Edwin H. Spanier 

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80030-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Context-free grammar forms
• Familles de langages translatables et fermées par crochet
• An Observation on Relative Parsing Time
• Substitution of grammar forms

Cited In (9)

• Pushdown acceptor forms
• Strict interpretations of deterministic pushdown acceptors
• A prime decomposition theorem for grammatical families
• On strict interpretations of grammar forms
• Abstract families of context-free grammars
• Testing for grammatical coverings
• An approach to a unified theory of grammar and L forms
• On the equality of grammatical families
• Position-restricted grammar forms and grammars

This page was built for publication: The structure of context-free grammatical families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241983)