Skip to main content
SpringerLink
Log in

A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

 In this paper, we consider derivation trees in apex NLC graph languages. We show that for every graph H in arbitrary apex NLC graph language, a decomposition tree of H can be constructed from a derivation tree of H. We also show that there exists a hierarchy in the class of apex NLC graph languages when we restrict the number of nonterminals in the right-hand sides of productions in apex NLC graph grammars.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Mathematics, The University of Electro-Communications, 1-5-1, Chofugaoka, Chofu-shi, Tokyo, Japan, , , , , , JP

    Koichi Yamazaki

Authors
  1. Koichi Yamazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 5 July 1994/12 February 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamazaki, K. A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions. Acta Informatica 34, 325–335 (1997). https://doi.org/10.1007/s002360050087

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050087

Keywords

Search

Navigation