THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
From MaRDI portal
Publication:4795919
DOI10.1081/AGB-120016005zbMath1017.06008OpenAlexW1980639516MaRDI QIDQ4795919
Publication date: 24 August 2003
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/agb-120016005
dot-depth hierarchywreath product of semigroupstestable languagevariety of finite ordered semigroupsvariety of recognizable languages
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05)
Related Items (18)
Shuffle on positive varieties of languages ⋮ Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Languages polylog-time reducible to dot-depth 1/2 ⋮ Two algebraic approaches to variants of the concatenation product ⋮ Concatenation hierarchies: new bottle, old wine ⋮ Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ A Trichotomy for Regular Trail Queries ⋮ Pointwise extensions of GSOS-defined operations ⋮ Theme and Variations on the Concatenation Product ⋮ The Karoubi envelope of the mirage of a subshift ⋮ Languages of dot-depth 3/2 ⋮ AROUND DOT-DEPTH ONE ⋮ Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data ⋮ Generic results for concatenation hierarchies ⋮ Algebraic tools for the concatenation product. ⋮ A conjecture on the concatenation product
This page was built for publication: THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
