scientific article; zbMATH DE number 709441

zbMath0938.68680MaRDI QIDQ4318906

A. Gopalaratnam, Alexander Meduna

Publication date: 21 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (10)

Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Simple restriction in context-free rewriting ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ On the descriptional complexity of some rewriting mechanisms regulated by context conditions ⋮ Nonterminal complexity of tree controlled grammars ⋮ A note on the descriptional complexity of semi-conditional grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions ⋮ On context-free rewriting with a simple restriction and its computational completeness ⋮ On the computational completeness of matrix simple semi-conditional grammars

This page was built for publication: