Pages that link to "Item:Q2366686"
From MaRDI portal
The following pages link to On the expressive power of temporal logic (Q2366686):
Displaying 25 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Vectorial languages and linear temporal logic (Q1884965) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
- EF+EX Forest Algebras (Q2947153) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Matching Trace Patterns with Regular Policies (Q3618572) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- (Q4453869) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- (Q4988163) (← links)
- (Q5089284) (← links)
- A new proof of the locality of <b>R</b> (Q5246511) (← links)
- Cascade Products and Temporal Logics on Finite Trees (Q5262961) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- AN NP-COMPLETE FRAGMENT OF LTL (Q5462673) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)
