K. Skodinis, E. Wanke, Emptiness problems of eNCE graph languages, J. of Comp. Syst. Sci. 51 (1995), 472-485. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Normal Forms for Context-Free Node-Rewriting Hypergraph Grammars - Klempien-Hinrichs (4 citations) (Correct)
Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (3 citations) (Correct)
Finite Graph Automata for Linear and Boundary Graph Languages - Brandenburg, Skodinis (2001) (1 citation) Self-citation (Skodinis) (Correct)
The Bounded Tree-Width Problem of Context-Free Graph Languages - Skodinis (1997) Self-citation (Skodinis) (Correct)
The complexity of the Kn,n-problem for node.. - Konstantin Skodinis Self-citation (Skodinis) (Correct)
Degree Problems for eNCE Graph Grammars - Skodinis, Wanke Self-citation (Skodinis Wanke) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC