Pages that link to "Item:Q3452507"
From MaRDI portal
The following pages link to Definable relations and first-order query languages over strings (Q3452507):
Displayed 14 items.
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Document Spanners (Q2796400) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- (Q5091265) (← links)
- The Quantifier Alternation Hierarchy of Synchronous Relations (Q5092389) (← links)
- Graph Logics with Rational Relations (Q5278208) (← links)
- First-order and counting theories of<i>ω</i>-automatic structures (Q5387304) (← links)
- Regular model checking revisited (Q6045028) (← links)
- The past and future of embedded finite model theory (Q6173101) (← links)