Pages that link to "Item:Q1088982"
From MaRDI portal
The following pages link to First-order logic and star-free sets (Q1088982):
Displaying 50 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Logic and rational languages of words indexed by linear orderings (Q987379) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Languages and scanners (Q1177931) (← links)
- Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Star free expressions over the reals (Q1575940) (← 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)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids (Q3126014) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- The Algebraic Counterpart of the Wagner Hierarchy (Q3507423) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES (Q3538855) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- Logical definability on infinite traces (Q4630272) (← links)
- The product of rational languages (Q4630281) (← links)
- Polynomial closure and unambiguous product (Q4645191) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- Logical definability of some rational trace languages (Q4850330) (← links)
- LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES (Q4902889) (← links)
- EQUATIONAL DESCRIPTIONS OF LANGUAGES (Q4923277) (← links)
