Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Context-free graph language"'
Publikováno v:
Theoretical computer science
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties are studied. In adaptive star grammars, rules are actually schemata wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b64db074f4a19ec86b819c312725aa34
https://doi.org/10.1016/j.tcs.2010.04.038
https://doi.org/10.1016/j.tcs.2010.04.038
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Drewes, Frank1 drewes@cs.umu.se, Högberg, Johanna1 johanna@cs.umu.se
Publikováno v:
Theory of Computing Systems. Feb2007, Vol. 40 Issue 2, p163-185. 23p. 1 Diagram, 5 Charts.
Autor:
Engelfriet, Joost1 engelfri@liacs.nl, Maneth, Sebastian1,2 sebastian.maneth@epfl.ch
Publikováno v:
SIAM Journal on Computing. 2003, Vol. 32 Issue 4, p950-1006. 57p. 5 Diagrams.
Autor:
Maneth, Sebastian
Publikováno v:
International Journal of Foundations of Computer Science; Dec2015, Vol. 26 Issue 8, p1069-1100, 32p
Publikováno v:
Acta Informatica; 1994, Vol. 31 Issue 4, p341-378, 38p
Autor:
Hans-Jörg Kreowski
Publikováno v:
Graph-Grammars and Their Application to Computer Science and Biology ISBN: 354009525X
Graph-Grammars and Their Application to Computer Science and Biology
Graph-Grammars and Their Application to Computer Science and Biology
Each sufficiently large graph belonging to a context-free graph language (generated by an edge-replacement system) can be decomposed in three subgraphs FIRST, LINK and LAST, such that a suitable chain gluing of FIRST, LAST and N examples of LINK for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e87c8d423ce1ad6a1d24d3051b5aad53
https://doi.org/10.1007/bfb0025726
https://doi.org/10.1007/bfb0025726
This collection of papers deal with challenges in disciplines such as complexity theory, games, algorithms and semi group theory and discuss current chellenges in this field.
Autor:
Grzegorz Rozenberg
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then the list of areas which have interacted with the development of graph grammars has grown quite impressively. Beside
Autor:
Grzegorz Rozenberg, Arto Salomaa
The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when. the book Formal Languages by the second mentioned editor appeared, i