A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
From MaRDI portal
Publication:2799219
DOI10.1007/978-3-319-15579-1_55zbMath1423.68241OpenAlexW2278986358MaRDI QIDQ2799219
Parvaneh Babari, Manfred Droste
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_55
average behaviorpicture seriesNivat's theoremweighted logicpicture valuation monoidsweighted two-dimensional on-line tessellation automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Decomposition and factorization of chemical reaction transducers ⋮ Recognizable series on graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted tree automata and weighted logics
- Characterizations of recognizable picture series
- Syntactic methods in pattern recognition
- Some properties of two-dimensional on-line tessellation acceptors
- Complexity of two-dimensional patterns
- A characterization of recognizable picture languages by tilings by finite sets
- Recognizable picture languages and domino tiling
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata
- Weighted automata and weighted logics
- Weighted picture automata and weighted logics
- A survey of two-dimensional automata theory
- Expressiveness and Closure Properties for Quantitative Languages
- Alternating Weighted Automata
- Probabilistic Weighted Automata
- Unambiguous recognizable two-dimensional languages
- Weighted Logics for Traces
- Quantitative Languages
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted versus Probabilistic Logics
- Star-free picture expressions are strictly weaker than first-order logic
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Weighted Picture Automata and Weighted Logics
This page was built for publication: A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
