Hierarchy ofk-context-free languages

DOI10.1080/00207168908803694zbMath0672.68039OpenAlexW2119250974MaRDI QIDQ3826120

Kai Salomaa

Publication date: 1989

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

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

zbMATH Keywords

scheduleE0L languagespattern selector grammarsk-context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

A pumping result for 2-context-free languages ⋮ On elimination of erasing rules from E0S grammars ⋮ A note on uniformly limited ET0L systems with unique interpretation

Cites Work

• On the generative power of regular pattern grammars
• Pattern selector grammars and several parsing algorithms in the context- free style
• Applications of scheduling theory to formal language theory
• Concerning two-adjacent context-free languages
• A pumping result for 2-context-free languages
• Context-free grammars with selective rewriting
• Context-free like restrictions on selective rewriting
• Manipulating derivation forests by scheduling techniques
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Flat Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchy ofk-context-free languages