Pages that link to "Item:Q1361889"
From MaRDI portal
The following pages link to Polynomial closure and unambiguous product (Q1361889):
Displayed 39 items.
- Regular languages and partial commutations (Q391641) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Two algebraic approaches to variants of the concatenation product (Q861283) (← links)
- Permutation rewriting and algorithmic verification (Q865624) (← links)
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
- Polynomials, fragments of temporal logic and the variety DA over traces (Q880176) (← links)
- A note on partially ordered tree automata (Q975463) (← links)
- A counterexample to a conjecture concerning concatenation hierarchies (Q990089) (← links)
- Varieties and pseudovarieties of ordered normal bands (Q1293379) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- A Reiterman theorem for pseudovarieties of finite first-order structures (Q1921405) (← links)
- Machines that can output empty words (Q2272215) (← 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)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- A conjecture on the concatenation product (Q3147025) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA (Q3224953) (← links)
- Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
- Hierarchies of Piecewise Testable Languages (Q3533034) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- The Height of Factorization Forests (Q3599148) (← links)
- Factorization Forests (Q3637210) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- The globals of pseudovarieties of ordered semigroups containing<i>B</i><sub>2</sub>and an application to a problem proposed by Pin (Q4680724) (← links)
- Some results on<i>C</i>-varieties (Q4680738) (← links)
- Imre Simon: an exceptional graduate student (Q4680741) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- PROFINITE METHODS IN SEMIGROUP THEORY (Q4786315) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- EQUATIONAL DESCRIPTIONS OF LANGUAGES (Q4923277) (← links)
- AROUND DOT-DEPTH ONE (Q4923283) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)