Skip to main content
SpringerLink
Log in

Iso-array Acceptors and Learning

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4201))

Included in the following conference series:

Abstract

The notions of iso-arrays, iso-pictures, local iso-picture languages and recognizable iso-picture languages have been introduced and studied in [6]. In [6] we have provided an algorithm to learn local iso-picture languages through identification in the limit using positive data. In this paper, we construct a two-dimensional on-line tessellation automaton to recognize iso-picture languages and present an algorithm to learn recognizable iso-picture languages from positive data and restricted subset queries.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Learning regular sets from queries and counter examples. Inform. Comput 75, 87–106 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Symposium on switching and automata theory, pp. 155–160 (1967)

    Google Scholar 

  4. Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informatica 25(3,4), 399–422 (1996)

    MATH  MathSciNet  Google Scholar 

  5. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  6. Kalyani, T., Dare, V.R., Thomas, D.G.: Local and Recognizable iso Picture languages. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 738–743. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185, 15–45 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Siromoney, R., Mathew, L., Subramanian, K.G., Dare, V.R.: Learning of Recognizable Picture Languages. International Journal of Pattern Recognition and Artificial Intelligence 8, 627–639 (1994)

    Article  Google Scholar 

  9. Yokomori, T.: Learning local languages from positive data. In: Proceedings of Fujitsu IIAS - SIS Workshop on Computational Learning Theory 1989, Numazu, pp. 1–16 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, St. Joseph’s College of Engineering, Chennai, 119, India

    T. Kalyani

  2. Dept. of Mathematics, Madras Christian College, Tambaram, Chennai, 59, India

    V. R. Dare, D. G. Thomas & T. Robinson

Authors
  1. T. Kalyani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. R. Dare
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. Robinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

  2. Dept. of Computer Science, Kyoto Sangyo University, Kamigamo Motoyama, Kita-ku, Kyoto, Japan

    Satoshi Kobayashi

  3. Japan Biological Informatics Consortium, 10F TIME24 Building, 2-45 Aomi, Koto-ku, 135-8073, Tokyo, Japan

    Kengo Sato

  4. Department of Information and Communication Engineering, Graduate School of Electro-Communications, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan

    Tetsuro Nishino

  5. Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofugaoka 1–5–1, Chofu, 182-8585, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalyani, T., Dare, V.R., Thomas, D.G., Robinson, T. (2006). Iso-array Acceptors and Learning. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2006. Lecture Notes in Computer Science(), vol 4201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11872436_27

Download citation

  • DOI: https://doi.org/10.1007/11872436_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45264-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation