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

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.

Authors

• C.W. Kim
• D.H. Lee

Keywords

No keywords are indexed for this paper.