Pages that link to "Item:Q4635815"
From MaRDI portal
The following pages link to Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (Q4635815):
Displaying 11 items.
- The algebraic theory of Parikh automata (Q722218) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- Resynchronizing Classes of Word Relations (Q5002809) (← links)
- Closure properties of synchronized relations (Q5090470) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- Graph Logics with Rational Relations (Q5278208) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
- Synchronization of Parikh automata (Q6067332) (← links)