2014
DOI: 10.12988/ams.2014.46500
|View full text |Cite
|
Sign up to set email alerts
|

Infinite triangular arrays and recognizability

Abstract: In this paper the concept of local languages is extended to infinite triangular arrays and ωω local languages are defined. ωω-recognizable languages of infinite triangular arrays accepted by two direction online tesselation automata are considered. Properties of these languages are studied.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…In 1 we learn about recognizable infinite array languages. In 6 we study the recognizability of infinite arrays and in 3 we define the recognizability of infinite triangular pictures. In this paper we consider another formalism hrl-domino system to recognize infinite triangular picture languages.…”
Section: Introductionmentioning
confidence: 99%
“…In 1 we learn about recognizable infinite array languages. In 6 we study the recognizability of infinite arrays and in 3 we define the recognizability of infinite triangular pictures. In this paper we consider another formalism hrl-domino system to recognize infinite triangular picture languages.…”
Section: Introductionmentioning
confidence: 99%