1996
DOI: 10.1006/inco.1996.0018
|View full text |Cite
|
Sign up to set email alerts
|

Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
40
0

Year Published

1997
1997
2016
2016

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 78 publications
(41 citation statements)
references
References 0 publications
1
40
0
Order By: Relevance
“…The normalization of the logic -reducing it to its "one first-order variable" fragment, explicitly expresses the local feature of MSO on pictures. The results and methods of Item 1 can be summed as follows: one exploits the homogeneous framework of logic for making simpler, more explicit -using only one first-order variable -and more uniform the proof and ideas of the main result of Giammarresi et al [23,22]; this allows us to generalize it to any dimension and, potentially, to other regular structures.…”
Section: Significance Of Our Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The normalization of the logic -reducing it to its "one first-order variable" fragment, explicitly expresses the local feature of MSO on pictures. The results and methods of Item 1 can be summed as follows: one exploits the homogeneous framework of logic for making simpler, more explicit -using only one first-order variable -and more uniform the proof and ideas of the main result of Giammarresi et al [23,22]; this allows us to generalize it to any dimension and, potentially, to other regular structures.…”
Section: Significance Of Our Resultsmentioning
confidence: 99%
“…In a series of papers culminating in [23], Giammarresi et al proved that a 2-picture language is recognizable (i.e. is the projection of a local picture language) iff it is definable in existential monadic logic (EMSO).…”
Section: Introduction: Context and Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…In fact, a language is locally threshold testable iff it is definable by a first-order formula in the signature {S 1 , S 2 , {P a } a∈Σ } ( [32]), while is locally testable if and only if it is definable by a first-order formula in the signature {S 1 , S 2 , {P a } a∈Σ , lef t, right, top, bottom}, where lef t, right, top, bottom are unary predicates saying that a position is at the respective border [40].…”
Section: Logic Formulasmentioning
confidence: 99%