Research Article
Learning Very Simple Matrix Grammar
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 180 - Issue 22 |
| Published: Feb 2018 |
| Authors: M. Iffath Mubeen, J. D. Emerald Princess Sheela, D. G. Thomas |
10.5120/ijca2018916512
|
M. Iffath Mubeen, J. D. Emerald Princess Sheela, D. G. Thomas . Learning Very Simple Matrix Grammar. International Journal of Computer Applications. 180, 22 (Feb 2018), 33-40. DOI=10.5120/ijca2018916512
@article{ 10.5120/ijca2018916512,
author = { M. Iffath Mubeen,J. D. Emerald Princess Sheela,D. G. Thomas },
title = { Learning Very Simple Matrix Grammar },
journal = { International Journal of Computer Applications },
year = { 2018 },
volume = { 180 },
number = { 22 },
pages = { 33-40 },
doi = { 10.5120/ijca2018916512 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2018
%A M. Iffath Mubeen
%A J. D. Emerald Princess Sheela
%A D. G. Thomas
%T Learning Very Simple Matrix Grammar%T
%J International Journal of Computer Applications
%V 180
%N 22
%P 33-40
%R 10.5120/ijca2018916512
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A linguistic model to generate matrices (arrays of terminals) to recognize pictures was introduced by Rani Siromoney [1]. Yokomori introduced very simple grammars and studied the problem of identifying the class in the limit from positive data [2]. Here a new grammar called very simple matrix grammar is introduced and shown that this class is polynomial time identifiable in the limit from positive data.
References
- Rani Siromoney: On equal matrix languages. Information and control. 14(2)(1969) 135–151
- Yokomori T. On polynomial - time identification of very simple grammars from positive data. Theoretical computer science 298 (2003)179-206
- A.Rosenfeld and J.L.Pfaltyz. Sequential operations in digital picture processing. J.Assoc.Comput.Mach.13, 1966, pp. 471-494.
- Gift Siromoney et al. Abstract families of matrices and picture languages. Computer graphics and image processing (1972) I, (284-307)
- Yokomori, T., On polynomial-time learnability in the limit of strictly deterministic automata. Machine learning 19(1995), 153-179.
Index Terms
Keywords