Pages that link to "Item:Q1109125"
From MaRDI portal
The following pages link to Semigroups and languages of dot-depth two (Q1109125):
Displaying 15 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- A counterexample to a conjecture concerning concatenation hierarchies (Q990089) (← links)
- Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Closure of varieties of languages under products with counter (Q1201878) (← links)
- A unified syntactical approach to theorems of Putcha, Margolis, and Straubing on finite power semigroups (Q1206787) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← 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)
