The following pages link to Dot-depth of star-free events (Q2546343):
Displaying 50 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Characterizations of some classes of regular events (Q1083210) (← 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 of R-trivial monoids (Q1146010) (← links)
- A generalization of the Schützenberger product of finite monoids (Q1150445) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Star-free trace languages (Q1193878) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- A generalization of finiteness (Q1236192) (← links)
- Run languages (Q1240067) (← links)
- The dot-depth hierarchy of star-free languages is infinite (Q1242697) (← 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)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- Varieties (Q2074217) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Concatenation-free languages (Q2357107) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Dot-depth of star-free events (Q2546343) (← links)
- Classification of noncounting events (Q2553949) (← links)
- Characterizations of locally testable events (Q2558849) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← 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)
- A conjecture on the concatenation product (Q3147025) (← links)
- An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321) (← links)
