Abstract families of context-free grammars

DOI10.1080/00207168108803233zbMath0454.68095OpenAlexW2027619039MaRDI QIDQ3902532

David A. Workman

Publication date: 1981

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1065&context=cstech

zbMATH Keywords

abstract families of languagesderivation bounded grammarsnonexpansive grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Abstract families of context-free grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-free grammar forms
• The structure of context-free grammatical families
• Derivation-bounded languages
• Principal AFL
• A characterization of context-free languages
• Abstract families of context-free grammars
• Grammar Schemata
• Some problems of finite representability
• Finite-Turn Pushdown Automata
• Associate languages and derivational complexity of formal grammars and languages
• Phrase structure languages, finite machines, and channel capacity

This page was built for publication: Abstract families of context-free grammars