Node replacement graph languages squeezed with chains, trees, and forests

Changwook Kim, Dong Hoon Lee

Research output: Contribution to journalArticle

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)63-77
Number of pages15
JournalInformation and Computation
Volume117
Issue number1
DOIs
Publication statusPublished - 1995 Feb 15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Node replacement graph languages squeezed with chains, trees, and forests'. Together they form a unique fingerprint.

  • Cite this