Similar Items: Defining Recursive Predicates in Graph Orders
- Monadic second-order definable graph orderings
- Semantics of Higher-Order Recursion Schemes
- Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs
- Existential Definability over the Subword Ordering
- Connection Matrices and the Definability of Graph Parameters