INFINITE ARRAYS AND RECOGNIZABILITY-Reference-Cited by-同舟云学术

INFINITE ARRAYS AND RECOGNIZABILITY

Published:2000-06 Issue:04 Volume:14 Page:525-536
ISSN:0218-0014
Container-title:International Journal of Pattern Recognition and Artificial Intelligence
language:en
Short-container-title:Int. J. Patt. Recogn. Artif. Intell.

Author:

DARE V. R.¹,SUBRAMANIAN K. G.¹,THOMAS D. G.¹,SIROMONEY R.¹,LE SAEC B.²

Affiliation:

1. Department of Mathematics, Madras Christian College, Tambaram, Madras – 600 059, India

2. LaBRI, Universite Bordeaux I, Talence, France

Abstract

In this paper, the concept of local languages is extended to infinite arrays and ωω-local languages are defined. ωω-recognizable languages of infinite arrays accepted by online tesselation automata are considered. Properties of these languages are studied. The notion of Muller recognizability is extended to infinite arrays. This is related to acceptance of infinite arrays by online tesselation automata.

Publisher

World Scientific Pub Co Pte Lt

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218001400000337

Reference4 articles.

1. RECOGNIZABLE PICTURE LANGUAGES

2. Some properties of two-dimensional on-line tessellation acceptors

3. Pictures of functions and their acceptability by automata

4. Infinite arrays and infinite computations

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Subclasses of Recognizable $ω ω -$ Partial Array Languages;Journal of Mathematics;2022-09-12

2. HRL-Local Infinite Triangular Array Languages;Brazilian Archives of Biology and Technology;2016

3. $$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems;Language and Automata Theory and Applications;2016

4. Shuffle on Trajectories over Finite Array Languages;Lecture Notes in Computer Science;2011

5. On Recognizable Infinite Array Languages;Lecture Notes in Computer Science;2004