Complexity of boundary graph languages
RAIRO-Theor. Inf. Appl., 24 3 (1990) 267-274
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the structure of linear apex NLC graph grammars
Changwook KimTheoretical Computer Science 438 28 (2012)
https://doi.org/10.1016/j.tcs.2012.02.038
Finite graph automata for linear and boundary graph languages
F.J. Brandenburg and K. SkodinisTheoretical Computer Science 332 (1-3) 199 (2005)
https://doi.org/10.1016/j.tcs.2004.09.040
Separation Results for Separated Apex NLC and NCE Graph Languages
Changwook KimJournal of Computer and System Sciences 62 (4) 608 (2001)
https://doi.org/10.1006/jcss.2001.1749
HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting
Changwook Kim and Tae Eui JeongTheoretical Computer Science 223 (1-2) 143 (1999)
https://doi.org/10.1016/S0304-3975(99)00258-3
A hierarchy of eNCE families of graph languages
Changwook KimTheoretical Computer Science 186 (1-2) 157 (1997)
https://doi.org/10.1016/S0304-3975(97)86542-5
The Bounded Degree Problem for eNCE Graph Grammars
Konstantin Skodinis and Egon WankeInformation and Computation 135 (1) 15 (1997)
https://doi.org/10.1006/inco.1997.2628
Graph Grammars and Their Application to Computer Science
Changwook Kim and Tae Eui JeongLecture Notes in Computer Science, Graph Grammars and Their Application to Computer Science 1073 383 (1996)
https://doi.org/10.1007/3-540-61228-9_100
Separating k-separated eNCE graph languages
Changwook Kim and Dong Hoon LeeTheoretical Computer Science 120 (2) 247 (1993)
https://doi.org/10.1016/0304-3975(93)90290-A
Nonterminal separation in graph grammars
Joost Engelfriet, George Leih and Grzegorz RozenbergTheoretical Computer Science 82 (1) 95 (1991)
https://doi.org/10.1016/0304-3975(91)90174-Z
Rewriting Techniques and Applications
Franz J. BrandenburgLecture Notes in Computer Science, Rewriting Techniques and Applications 488 312 (1991)
https://doi.org/10.1007/3-540-53904-2_106
Graph Grammars and Their Application to Computer Science
Joost Engelfriet and Grzegorz RozenbergLecture Notes in Computer Science, Graph Grammars and Their Application to Computer Science 532 12 (1991)
https://doi.org/10.1007/BFb0017374