The following pages link to (Q4036584):
Displaying 23 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Subshifts as models for MSO logic (Q384929) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Some notes on graph automata, tiling systems and partition logic (Q1273066) (← links)
- Recognizable picture languages and domino tiling (Q1391540) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (Q2799219) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- (Q3386623) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Subshifts, Languages and Logic (Q3637233) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- Asynchronous cellular automata for infinite traces (Q5204349) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)
