Non-context-free grammars generating context-free languages

DOI10.1016/S0019-9958(74)80038-0zbMATH Open0289.68042MaRDI QIDQ4041111FDOQ4041111

Authors: Brenda S. Baker 

Publication date: 1974

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• On the degrees of non-regularity and non-context-freeness
• The ancestor width of grammars and languages
• The semantic and syntactic manipulation of vacancies in associative binary trees
• Accepting splicing systems with permitting and forbidding words
• On the Degree of Extension of Some Models Defining Non-Regular Languages
• A generalization of leftmost derivations
• One-sided random context grammars with leftmost derivations
• On permutative grammars generating context-free languages
• On grammar forms with terminal context
• Complexity of normal form grammars

This page was built for publication: Non-context-free grammars generating context-free languages

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