On recognizable infinite array languages

Authors:
S. Gnanasekaran;V. R. Dare
Affiliations:
Department of Mathematics, Periyar Arts College, Cuddalore, Tamil Nadu, India;Department of Mathematics, Madras Christian College, Tambaram, Chennai, Tamil Nadu, India
Venue:
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Year:
2004

Citing 7
Cited 0

Learning local and recognizable &ohgr;-languages and monadic logic programs

Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Recognizable picture languages and domino tiling

Theoretical Computer Science
Recognizability of rectangular pictures by Wang systems

Journal of Automata, Languages and Combinatorics
Automata, Languages, and Machines

Automata, Languages, and Machines
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
An Aperiodic Set of Wang Cubes

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recognizable infinite array language or recognizable ωω-language is defined as the image of a local ωω-language by an alphabetic morphism. Here, we introduce Wang systems for ωω-languages and prove that the class of ωω-languages obtained by Wang systems is the same as the class of recognizable ωω-languages. We give automata characterization to the recognizable ωω-languages. We provide an algorithm for learning recognizable infinite array languages from positive data and restricted superset queries.