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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Culik II, K., Kari, J.: An aperiodic set of Wang cubes. LNCS, vol. 1046, pp. 137–147. Springer, Heidelberg (1996)
Dare, V.R., Subramanian, K.G., Thomas, D.G., Siromoney, R.: Infinite arrays and recognizability. International Journal of Pattern Recognition and Artificial Intelligence 14(4), 525–536 (2000)
De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics 2(4), 269–288 (1997)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1974)
Giammerresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recognition and Artificial Intelligence 6, 241–256 (1992)
Gnanasekaran, S., Dare, V.R.: Infinite arrays and domino systems. Electronic Notes in Discrete Mathematics 12 (2003)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tesselation acceptor. Inf. Sci. 13, 95–121 (1977)
Latteux, M., Simplot, D.: Theoretical Computer Science 178, 275–283 (1997)
Saoudi, A., Yokomori, T.: Learning local and recognizable ω-languages and monodic logic programs. In: Proc. Euro COLT 1993 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gnanasekaran, S., Dare, V.R. (2004). On Recognizable Infinite Array Languages. In: Klette, R., Žunić, J. (eds) Combinatorial Image Analysis. IWCIA 2004. Lecture Notes in Computer Science, vol 3322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30503-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-30503-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23942-0
Online ISBN: 978-3-540-30503-3
eBook Packages: Computer ScienceComputer Science (R0)