Pages that link to "Item:Q1917078"
From MaRDI portal
The following pages link to Monadic second-order logic over rectangular pictures and recognizability by tiling systems (Q1917078):
Displaying 37 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Subshifts as models for MSO logic (Q384929) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- Perfectly quilted rectangular snake tilings (Q1013125) (← links)
- Characterizations of recognizable picture series (Q1022605) (← links)
- Some notes on graph automata, tiling systems and partition logic (Q1273066) (← links)
- A characterization of recognizable picture languages by tilings by finite sets (Q1292300) (← links)
- Context-sensitive string languages and recognizable picture languages (Q1376420) (← links)
- Recognizable picture languages and domino tiling (Q1391540) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
- Weighted automata (Q2074206) (← links)
- Two-dimensional models (Q2074211) (← links)
- Communication complexity tools on recognizable picture languages (Q2330109) (← links)
- A Nivat theorem for weighted picture automata and weighted MSO logics (Q2424674) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- Weighted picture automata and weighted logics (Q2429722) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes (Q2676458) (← links)
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (Q2799219) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES (Q2909092) (← links)
- Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory (Q2927640) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- (Q3386623) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Tiling Recognizable Two-Dimensional Languages (Q3522860) (← links)
- Recognizable vs. Regular Picture Languages (Q3522862) (← links)
- Subshifts, Languages and Logic (Q3637233) (← links)
- Star-free picture expressions are strictly weaker than first-order logic (Q4571966) (← links)
- Regular expressions and context-free grammars for picture languages (Q5048931) (← links)
- Two-dimensional Sgraffito automata (Q5248876) (← links)
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures (Q5958302) (← links)
