Pages that link to "Item:Q5044763"
From MaRDI portal
The following pages link to On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763):
Displayed 11 items.
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Parity game reductions (Q1656552) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- (Q5111633) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Simulation relations and applications in formal methods (Q6113980) (← links)