scientific article; zbMATH DE number 3846895

MaRDI QIDQ3316615zbMATH OpenFDO

Authors Dirk Janssens, Grzegorz Rozenberg

Publication date 1983

zbMATH Keywords

graph grammarsNLC grammarsnode-label controlled graph grammarsstring languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3890755
• Neighborhood-uniform NLC grammars
• scientific article; zbMATH DE number 3846896
• On LC(0) grammars and languages
• Nonterminal bounded NLC graph grammars
• scientific article; zbMATH DE number 17539
• scientific article; zbMATH DE number 2050921
• scientific article; zbMATH DE number 1390059
• scientific article; zbMATH DE number 3309208
• Some results on contextual grammars^∗

Cited in

(14)

• Handle NLC grammars and r. e. languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Power properties of NLC graph grammars with a polynomial membership problem
• Monadic second-order definable graph transductions: a survey
• Graph grammars according to the type of input and manipulated data: a survey
• Handle-rewriting hypergraph grammars
• On the inference of non-confluent NLC graph grammars
• Neighborhood-uniform NLC grammars
• scientific article; zbMATH DE number 3856429 (Why is no real title available?)
• scientific article; zbMATH DE number 3890755 (Why is no real title available?)
• scientific article; zbMATH DE number 4049106 (Why is no real title available?)
• Narrowing grammar: theory, implementation, and applications
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• Results of NLC grammars with one-letter terminal alphabets

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 Q3316615)