The following pages link to (Q2754145):
Displaying 4 items.
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)