Characterizations of recognizable picture series
From MaRDI portal
Publication:1022605
DOI10.1016/j.tcs.2007.01.019zbMath1164.68016OpenAlexW1993241905MaRDI QIDQ1022605
Publication date: 22 June 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.019
Related Items
A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Weighted three directions OTA and weighted hexapolic picture automata ⋮ Weighted picture automata and weighted logics ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Classes of two-dimensional languages and recognizability conditions ⋮ Networks of picture processors as problem solvers ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ Valuations of Weighted Automata: Doing It in a Rational Way
Cites Work
- 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
- Tile rewriting grammars and picture languages
- Collage of two-dimensional words
- A survey of two-dimensional automata theory
- On the definition of a family of automata
- Unambiguous recognizable two-dimensional languages
- Star-free picture expressions are strictly weaker than first-order logic
- Regular expressions and context-free grammars for picture languages
- Weighted Picture Automata and Weighted Logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
