Iso-array acceptors and learning

Authors:
T. Kalyani;V. R. Dare;D. G. Thomas;T. Robinson
Affiliations:
Dept. of Mathematics, St. Joseph's College of Engineering, Chennai, India;Dept. of Mathematics, Madras Christian College, Tambaram, Chennai, India;Dept. of Mathematics, Madras Christian College, Tambaram, Chennai, India;Dept. of Mathematics, Madras Christian College, Tambaram, Chennai, India
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 4
Cited 2

Learning regular sets from queries and counterexamples

Information and Computation
Two-dimensional finite state recognizability

Fundamenta Informaticae - Special issue on formal language theory
Recent advances of grammatical inference

Theoretical Computer Science - Special issue on algorithmic learning theory
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)

Rewriting P systems generating iso-picture languages

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Collage of iso-picture languages and P-systems

CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notions of iso-arrays, iso-pictures, local iso-picture languages and recognizable iso-picture languages have been introduced and studied in [6]. In [6] we have provided an algorithm to learn local iso-picture languages through identification in the limit using positive data. In this paper, we construct a two-dimensional on-line tessellation automaton to recognize iso-picture languages and present an algorithm to learn recognizable iso-picture languages from positive data and restricted subset queries.