Pages that link to "Item:Q1242697"
From MaRDI portal
The following pages link to The dot-depth hierarchy of star-free languages is infinite (Q1242697):
Displaying 50 items.
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Programs over aperiodic monoids (Q1122664) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Variétés de langages et monoide des parties (Q1147826) (← links)
- A generalization of the Schützenberger product of finite monoids (Q1150445) (← links)
- Recognizable languages and congruences (Q1172156) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Regular languages in \(NC\) (Q1191027) (← 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)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← 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)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- The finite power property in free groups (Q1870586) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- Robert Knast (1940-1994) (Q1910637) (← 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)
- Measuring power of locally testable languages (Q2164008) (← links)
- The regular languages of wire linear \(\mathrm{AC}^0\) (Q2170278) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← 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)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- (Q3673124) (← links)
- Sur le produit avec compteur modulo un nombre premier (Q4032305) (← links)
