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):
Displaying 21 items.
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← 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)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- An Ehrenfeucht-Fraïssé game for \(\mathcal L_{\omega_1\omega}\) (Q2856638) (← links)
- (Q3078324) (← links)
- An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321) (← links)
- Comparing the Power of Games on Graphs (Q4366126) (← 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)
- Games on Trees and Syntactical Complexity of Formulas (Q5436997) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
