Learning even equal matrix languages based on control sets
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.
Unable to display preview. Download preview PDF.
- 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
- 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