scientific article; zbMATH DE number 3917735

MaRDI QIDQ3692891zbMATH OpenFDO

Authors Klaus-Jörn Lange, Emo Welzl

Publication date 1985

zbMATH Keywords

complexity of languagescontext-free grammarslanguages of multisetsmembership problemregular sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• The complexity of connectivity problems on context-free graph languages
• Syntactic complexity of context-free grammars over word monoids
• scientific article; zbMATH DE number 17563
• On multiple context-free grammars

Cited in

(2)

• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• On the complexity of the string generation problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692891)