Skip to main content

Learning even equal matrix languages based on control sets

  • Communications
  • Conference paper
  • First Online:
Parallel Image Analysis (ICPIA 1992)

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

Included in the following conference series:

Abstract

An equal matrix grammar is a parallel rewriting system. In this paper, we shall show a subclass of equal matrix languages, called even equal matrix languages, for which the learning problem is reduced to the problem of learning regular sets.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin and C. H. Smith. Inductive inference: Theory and methods. ACM Computing Surveys, 15(3):237–269, 1983.

    Article  Google Scholar 

  2. S. Crespi-Reghizzi and D. Mandrioli. Petri nets and commutative grammars. Internal Report 74-5, Laboratorio di Calcolatori, Instituto di Electtrotecnica ed Electtronica del Politecnico di Milano, 1974.

    Google Scholar 

  3. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.

    Google Scholar 

  4. O. H. Ibarra. Simple matrix languages. Information and Control, 17:359–394, 1970.

    Google Scholar 

  5. L. Pitt. Inductive inference, dfas, and computational complexity. In K. P. Jantke, editor, Proceedings of 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, 397, pages 18–44. Springer-Verlag, 1989.

    Google Scholar 

  6. A. Salomaa. Formal Languages. Academic Press, Inc., New York, 1973.

    Google Scholar 

  7. R. Siromoney. On equal matrix languages. Information and Control, 14:135–151, 1969.

    Google Scholar 

  8. R. Siromoney, A. Huq, M. Chandrasekaran, and K. G. Subramanian. Pattern classification with equal matrix grammars. In Proceedings of the IAPR Workshop on Syntactic and Structural Pattern Recognition, 1990.

    Google Scholar 

  9. Y. Takada. Learning semilinear sets from examples and via queries. To appear in Theoretical Computer Science.

    Google Scholar 

  10. Y. Takada. Grammatical inference for even linear languages based on control sets. Information Processing Letters, 28(4):193–199, 1988.

    Article  Google Scholar 

  11. Y. Takada. Learning equal matrix grammars with structural information. In LA winter Symposium, pages 61–72, 1990.

    Google Scholar 

  12. D. Wood. Bounded parallelism and regular languages. In G. Rozenberg and A. Salomaa, editors, L Systems, Lecture Notes in Computer Science, No.15, pages 292–301. Springer-Verlag, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Akira Nakamura Maurice Nivat Ahmed Saoudi Patrick S. P. Wang Katsushi Inoue

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takada, Y. (1992). Learning even equal matrix languages based on control sets. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-56346-6_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56346-4

  • Online ISBN: 978-3-540-47538-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics