Edge-label controlled graph grammars (Q909484)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Edge-label controlled graph grammars	scientific article

Statements

scholarly article

0 references

Edge-label controlled graph grammars (English)

0 references

Michael G. Main

0 references

Grzegorz Rozenberg

0 references

Journal of Computer and System Sciences

0 references

publication date

1990

0 references

zbMATH Keywords

graph-grammar

0 references

MaRDI profile type

MaRDI publication profile

0 references

An axiomatic definition of context-free rewriting and its application to NLC graph grammars

0 references

0 references

0 references

0 references

On the structure of node-label-controlled graph languages

0 references

Restrictions, extensions, and variations of NLC grammars

0 references

Decision problems for node label controlled graph grammars

0 references

Graph grammars with neighbourhood-controlled embedding

0 references

Direction independent context-sensitive grammars

0 references

Handle NLC grammars and r. e. languages

0 references

0 references

An “Interchange Lemma” for Context-Free Languages

0 references

Classes of Recursively Enumerable Sets and Their Decision Problems

0 references

Boundary NLC graph grammars—Basic definitions, normal forms, and complexity

0 references

full work available at URL

https://doi.org/10.1016/0022-0000(90)90012-a

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0022-0000(90)90012-A

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:909484

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q909484&oldid=37439650"