The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
From MaRDI portal
Publication:6195308
DOI10.1142/s0218196724500024MaRDI QIDQ6195308
Publication date: 13 March 2024
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper set monoids and length preserving morphisms
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- Idempotents, regular elements and sequences from finite semigroups
- Polynomial closure and unambiguous product
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Algebraic tools for the concatenation product.
- Shuffle on positive varieties of languages
- Nonstandard characterization of pseudovarieties
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Profinite semigroups, Mal'cev products, and identities
- Finite semigroup varieties of the form V*D
- Generic results for concatenation hierarchies
- Dot-depth of star-free events
- Pointlike sets for varieties determined by groups
- On Decidability of Intermediate Levels of Concatenation Hierarchies
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- Separating regular languages with two quantifier alternations
- Separating Regular Languages with Two Quantifiers Alternations
- Adding Successor
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words
- On fixed points of the lower set operator
- Reducibility vs. definability for pseudovarieties of semigroups
- On finite monoids having only trivial subgroups
- Profinite Methods in Automata Theory
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
This page was built for publication: The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
