Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests

doi:10.1006/inco.1995.1029

Information and Computation

Volume 117, Issue 1, 15 February 1995, Pages 63-77

https://doi.org/10.1006/inco.1995.1029 Get rights and content

Under an Elsevier user license

open archive

Abstract

We present results on language-theoretic properties (such as closure, membership, and other decision properties) of node replacement graph languages (such as NLC, B-NLC, and Lin-NLC languages) squeezed with chains, trees, and forests.

Information and Computation

Regular ArticleNode Replacement Graph Languages Squeezed with Chains, Trees, and Forests

Abstract

Regular Article
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests