Skip to main content
SpringerLink
Log in

Learning of restricted RNLC graph languages

  • Session 5
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1004))

Included in the following conference series:

Abstract

We consider learning of graph languages (sets of graphs) which are generated by restricted regular node label controlled (for short RNLC) graph grammars. We show that for any restricted RNLC graph languages L, given the Parikh image of L, one can construct a restricted RNLC graph grammar G such that L(G)=L in polynomial time. We present an algorithm to construct a restricted RNLC graph grammar which generates an unknown restricted RNLC graph language using restricted superset queries and restricted subset queries. We also showed that for a fixed nonnegative integer t, this algorithm halts in polynomial time when the Parikh image of the unknown restricted RNLC graph languages has at most t-periods.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. IJ.J. Aalbersherg, A. Ehrenfeucht, and G. Rozenber, On the membership problem for regular DNLC grammars, Discrete Applied Mathematics 13:79–85 (1986).

    Google Scholar 

  2. D. Angluin, Learning regular sets from queries and counter examples, Information and Computation, 75 (1987), pp.87–106.

    Google Scholar 

  3. D. Angluin, Queries and concept learning, Machine Learning, 2 (1987), pp.319–342.

    Google Scholar 

  4. Angluin, D. and M. Kharitonov: When Won't Membership Queries Help? in Proc. of 23nd STOC, ACM, 1991, pp.444–454.

    Google Scholar 

  5. M. Bauderon, and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory. 20:83–127 (1987).

    Google Scholar 

  6. F.J. Brandenburg and K. Skodinis, Edge-marking Graph Automata and Linear Graph Languages, unpublished manuscript (1994).

    Google Scholar 

  7. C. Domingo and J. Shawe-Taylor, Positive and Negative Results for Learning Minor Closed Graph Classes, unpublished manuscript (1995).

    Google Scholar 

  8. J.V. Leeuwen, Graph algorithms, in Handbook of theoretical computer science vol. A, (ed. J.V. Leeuwen), (1990), pp.527–631.

    Google Scholar 

  9. D. Janssens and G. Rozenberg, On the structure of node label controlled graph languages, Inform. Sci. 20:191–216 (1980).

    Google Scholar 

  10. G. Rozenberg and E. Welzl, Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. Control 69:136–167 (1986).

    Google Scholar 

  11. Y. Takada, Learning semilinear sets from examples and via queries, Theoretical Computer Science 104 (1992), pp.207–233.

    Google Scholar 

  12. T. Uchida, T. Shoudai, and S. Miyano, Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems, IEICE TRANS. INF. & SYST., vol.E78-D, no.2 (1995), pp.99–112.

    Google Scholar 

  13. K. Yamazaki, A normal form problem for the unlabeled boundary NLC graph languages, Inform. Comput. 120:1–11 (1995).

    Google Scholar 

  14. K. Yamazaki and T. Yaku, A Pumping Lemma and Structure of Derivations in the Boundary NLC Graph Languages, Inform. Sci. 75:81–97(1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Tokai University, 1117 Kitakaname Hiratsuka-Shi, 259-12, Kanagawa-Ken, Japan

    Sei'ichi Tani

  2. Dept. of Computer Sci. and Inform. Math., University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-Shi, 182, Tokyo, Japan

    Koichi Yamazaki

Authors
  1. Sei'ichi Tani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koichi Yamazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tani, S., Yamazaki, K. (1995). Learning of restricted RNLC graph languages. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015421

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation