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.
| Original language | English |
|---|---|
| Pages (from-to) | 63-77 |
| Number of pages | 15 |
| Journal | Information and Computation |
| Volume | 117 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1995 Feb 15 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics