✦ LIBER ✦
Separation Results for Separated Apex NLC and NCE Graph Languages
✍ Scribed by Changwook Kim
- Book ID
- 102587275
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 268 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
✦ Synopsis
Relations among various types of node replacement graph languages are known in the literature but there has remained a gap in the hierarchy of these graph languages. The present paper fills this gap by proving a separation result for k-separated apex graph languages and by extending a known result for k-separated graph languages. This yields, together with other known relations, a complete hierarchy of NLC, NCE, eNCE graph languages and their k-separated, linear, andÂor apex subclasses.