On grammars with local and global context conditions

DOI10.1080/00207169308804159zbMath0824.68066OpenAlexW2042505690MaRDI QIDQ4323411

Erzsébet Csuhaj-Varjú

Publication date: 16 February 1995

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

Full work available at URL: https://doi.org/10.1080/00207169308804159

zbMATH Keywords

context-free grammarrecursively enumerable languagesformal language theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

Cites Work

• Unnamed Item
• A variant of random context grammars: Semi-conditional grammars
• Generalized forbidding grammars
• On the generative capacity of conditional grammars
• One-sided and two-sided context in formal grammars
• Grammars with partial ordering of the rules
• Theory Is Forever

This page was built for publication: On grammars with local and global context conditions