scientific article

zbMath0603.68076MaRDI QIDQ3740261

Gheorghe Păun, Juergen Dassow

Publication date: 1985

Full work available at URL: https://eudml.org/doc/28692

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

zbMATH Keywords

matrix grammarserasing rulesprogrammed grammarsrandom context grammarsappearance checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Nonterminal complexity of tree controlled grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ Unnamed Item

Cites Work

• Six nonterminals are enough for generating each r.e. language by a matrix grammar
• Simple matrix languages
• Some restrictive devices for context-free grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: