Pages that link to "Item:Q3764124"
From MaRDI portal
The following pages link to Monadic second order definable relations on the binary tree (Q3764124):
Displaying 16 items.
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- SHEAF RECURSION AND A SEPARATION THEOREM (Q2933681) (← links)
- The full binary tree cannot be interpreted in a chain (Q3066806) (← links)
- Monadic representability of certain binary relations (Q3312231) (← links)
- Deciding whether a relation defined in Presburger logic can be defined in weaker logics (Q3514638) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law (Q5403017) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)
