Pages that link to "Item:Q1173413"
From MaRDI portal
The following pages link to Classifying regular events in symbolic logic (Q1173413):
Displaying 50 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Aural pattern recognition experiments and the subregular hierarchy (Q438585) (← links)
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- Equations and dot-depth one (Q688972) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Permutation rewriting and algorithmic verification (Q865624) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- A note on partially ordered tree automata (Q975463) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Characterizations of some classes of regular events (Q1083210) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- Locally trivial categories and unambiguous concatenation (Q1103056) (← 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)
- Regular languages in \(NC\) (Q1191027) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← 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)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- Polynomial closure of group languages and open sets of the Hall topology (Q1349899) (← links)
- First-order queries on databases embedded in an infinite structure (Q1350000) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Star free expressions over the reals (Q1575940) (← links)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← 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)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Refuting learning revisited. (Q1874232) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Weighted automata (Q2074206) (← links)
- Varieties (Q2074217) (← links)
- Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
