Pages that link to "Item:Q1183588"
From MaRDI portal
The following pages link to Polynomial operations and hierarchies of concatenation (Q1183588):
Displaying 17 items.
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- Geometrically closed positive varieties of languages (Q2084767) (← 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)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- A conjecture on the concatenation product (Q3147025) (← 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)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
