CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Learning Very Simple Matrix Grammar

by M. Iffath Mubeen, J. D. Emerald Princess Sheela, D. G. Thomas
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 180 - Number 22
Year of Publication: 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 },
issue_date = { Feb 2018 },
volume = { 180 },
number = { 22 },
month = { Feb },
year = { 2018 },
issn = { 0975-8887 },
pages = { 33-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume180/number22/29068-2018916512/ },
doi = { 10.5120/ijca2018916512 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:01:30.088051+05:30
%A M. Iffath Mubeen
%A J. D. Emerald Princess Sheela
%A D. G. Thomas
%T Learning Very Simple Matrix Grammar
%J International Journal of Computer Applications
%@ 0975-8887
%V 180
%N 22
%P 33-40
%D 2018
%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
  1. Rani Siromoney: On equal matrix languages. Information and control. 14(2)(1969) 135–151
  2. Yokomori T. On polynomial - time identification of very simple grammars from positive data. Theoretical computer science 298 (2003)179-206
  3. A.Rosenfeld and J.L.Pfaltyz. Sequential operations in digital picture processing. J.Assoc.Comput.Mach.13, 1966, pp. 471-494.
  4. Gift Siromoney et al. Abstract families of matrices and picture languages. Computer graphics and image processing (1972) I, (284-307)
  5. Yokomori, T., On polynomial-time learnability in the limit of strictly deterministic automata. Machine learning 19(1995), 153-179.
Index Terms

Computer Science
Information Sciences

Keywords

Very simple matrix grammar and language a-handle rule positive presentation inference from positive data characteristic sample schema representation.

Powered by PhDFocusTM