Grammars, derivation modes and properties of indexed and type-0 languages

DOI10.1016/0304-3975(87)90099-5zbMath0636.68096OpenAlexW2001168729MaRDI QIDQ1098316

J. Duske, Rainer Parchmann

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90099-5

zbMATH Keywords

context-free grammarindexed languagesDyck grammarhomomorphic characterizationsindex productions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Indexed counter languages ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear indexed languages
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• On deterministic indexed languages
• Closure properties of deterministic indexed languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Control sets on grammars
• One-way stack automata
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Grammars, derivation modes and properties of indexed and type-0 languages