The Complexity of Connectivity Problems on Context-Free Graph Languages

Egon Wanke. The Complexity of Connectivity Problems on Context-Free Graph Languages. J. Comput. Syst. Sci., 49(1):57-82, 1994.

@article{Wanke94:2,
  title = {The Complexity of Connectivity Problems on Context-Free Graph Languages},
  author = {Egon Wanke},
  year = {1994},
  tags = {graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/Wanke94%3A2},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {49},
  number = {1},
  pages = {57-82},
}