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 |
![]() |
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
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.