2015
DOI: 10.1007/978-3-319-15579-1_55
|View full text |Cite
|
Sign up to set email alerts
|

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Regular picture languages can equivalently be described in terms of automata, sets of tiles, rational operations, or monadic second order logic Inoue and Nakamura, 1977;Latteux and Simplot, 1997). The extension of regular picture languages to the quantitative setting led to the definition of recognizable picture series whose theoretical study has been of recent interest (Bozapalidis and Grammatikopoulou, 2005;Mäurer, 2005;Fichtner, 2011;Babari and Droste, 2015). Recognizable picture series were first introduced in (Bozapalidis and Grammatikopoulou, 2005) by means of Weighted Picture Automata.…”
Section: Weighted Picture Automatonmentioning
confidence: 99%
“…Regular picture languages can equivalently be described in terms of automata, sets of tiles, rational operations, or monadic second order logic Inoue and Nakamura, 1977;Latteux and Simplot, 1997). The extension of regular picture languages to the quantitative setting led to the definition of recognizable picture series whose theoretical study has been of recent interest (Bozapalidis and Grammatikopoulou, 2005;Mäurer, 2005;Fichtner, 2011;Babari and Droste, 2015). Recognizable picture series were first introduced in (Bozapalidis and Grammatikopoulou, 2005) by means of Weighted Picture Automata.…”
Section: Weighted Picture Automatonmentioning
confidence: 99%