scientific article

zbMath0643.68111MaRDI QIDQ3785993

Ijsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg

Publication date: 1987

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

zbMATH Keywords

membership problemNP-completelinear orderingcomponent-boundeddegree-boundedNLC graph grammarsNLOGRegular directed node-label controlled graph grammars

Mathematics Subject Classification ID

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

Related Items (2)

Power properties of NLC graph grammars with a polynomial membership problem ⋮ The complexity of regular DNLC graph languages

This page was built for publication: