On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Uniform and nonuniform recognizability
Theoretical Computer Science
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
Fundamenta Informaticae
Subshifts as models for MSO logic
Information and Computation
Hi-index | 0.00 |