Finite semigroup varieties of the form V*D
From MaRDI portal
Publication:2266068
DOI10.1016/0022-4049(85)90062-3zbMath0561.20042OpenAlexW2065599266MaRDI QIDQ2266068
Publication date: 1985
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(85)90062-3
rectangular bandsvarietiesmembership problemsubdirect productsrecognizable languagesnilpotent semigroupsideal extensionsleveldot-depthvariety of monoids
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (92)
Some complexity results for polynomial rational expressions. ⋮ Unnamed Item ⋮ On varieties of rational languages and variable length codes. II ⋮ ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS ⋮ POLYNOMIAL CLOSURE AND TOPOLOGY ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ On the expressive power of temporal logic ⋮ Pointlike sets and separation: a personal perspective ⋮ First-order logic and star-free sets ⋮ On Decidability of Intermediate Levels of Concatenation Hierarchies ⋮ Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Level two of the quantifier alternation hierarchy over infinite words ⋮ Pointlike sets for varieties determined by groups ⋮ Unnamed Item ⋮ A new algorithm for testing if a regular language is locally threshold testable ⋮ Locally trivial categories and unambiguous concatenation ⋮ Polynomial closure and unambiguous product ⋮ Languages polylog-time reducible to dot-depth 1/2 ⋮ Semigroups and languages of dot-depth two ⋮ Concatenation hierarchies: new bottle, old wine ⋮ Inclusion relations between some congruences related to the dot-depth hierarchy ⋮ Profinite categories and semidirect products ⋮ Inverse monoids of dot-depth two ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Alternation Hierarchies of First Order Logic with Regular Predicates ⋮ Finite semigroup varieties defined by programs ⋮ Unnamed Item ⋮ Locality and Centrality: The Variety ZG ⋮ Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ Efficiency of automata in semi-commutation verification techniques ⋮ The Schützenberger category of a semigroup. ⋮ Iterated periodicity over finite aperiodic semigroups ⋮ On κ-reducibility of pseudovarieties of the form V ∗D ⋮ On the varieties of languages associated with some varieties of finite monoids with commuting idempotents ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ The product of rational languages ⋮ Results on homomorphic realization of automata by \(\alpha_ 0\)-products ⋮ Languages and scanners ⋮ On iterated semidirect products of finite semilattices ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Two-sided wreath product of categories ⋮ Polynomial operations and hierarchies of concatenation ⋮ The word problem for \(\kappa \)-terms over the pseudovariety of local groups ⋮ ON THE DECIDABILITY OF MEMBERSHIP IN THE GLOBAL OF A MONOID PSEUDOVARIETY ⋮ Local varieties of completely regular monoids ⋮ Reversible Regular Languages: Logical and Algebraic Characterisations ⋮ The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages ⋮ Theme and Variations on the Concatenation Product ⋮ Standard automata and semidirect products of transformation semigroups ⋮ On a conjecture concerning dot-depth two languages ⋮ Games, equations and dot-depth two monoids ⋮ Equations and dot-depth one ⋮ Languages of dot-depth 3/2 ⋮ Circuit complexity of regular languages ⋮ Varieties of automata and transformation semigroups ⋮ Some results on the dot-depth hierarchy ⋮ SOME OPERATORS THAT PRESERVE THE LOCALITY OF A PSEUDOVARIETY OF SEMIGROUPS ⋮ AROUND DOT-DEPTH ONE ⋮ Level Two of the Quantifier Alternation Hierarchy over Infinite Words ⋮ Graph congruences and wreath products ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Unnamed Item ⋮ On Shuffle Ideals ⋮ On dot-depth two ⋮ Machines that can output empty words ⋮ The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin ⋮ The pseudovariety of semigroups of triangular matrices over a finite field ⋮ Imre Simon: an exceptional graduate student ⋮ Categories as algebra: An essential ingredient in the theory of monoids ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data ⋮ Infinite-vertex free profinite semigroupoids and symbolic dynamics. ⋮ Semigroup presentations for test local groups. ⋮ Representations of relatively free profinite semigroups, irreducibility, and order primitivity ⋮ Semidirect products of pseudovarieties from the universal algebraist's point of view ⋮ Unnamed Item ⋮ Separating regular languages with two quantifier alternations ⋮ Trees, congruences and varieties of finite semigroups ⋮ Generic results for concatenation hierarchies ⋮ Unnamed Item ⋮ Games, equations and the dot-depth hierarchy ⋮ Varieties ⋮ Constructing divisions into power groups ⋮ One quantifier alternation in first-order logic with modular predicates ⋮ A new proof of the locality of R ⋮ On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids ⋮ Characterizing level one in group-based concatenation hierarchies ⋮ Algebraic tools for the concatenation product. ⋮ Equations and monoid varieties of dot-depth one and two ⋮ A conjecture on the concatenation product ⋮ On a complete set of generators for dot-depth two
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Variétés de langages et monoide des parties
- Classification of finite monoids: the language approach
- On the complexity of finite semigroups
- On pseudovarieties
- The dot-depth hierarchy of star-free languages is infinite
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Graph congruences and wreath products
- Characterizations of locally testable events
- Algebraic decision procedures for local testability
- On finite monoids having only trivial subgroups
This page was built for publication: Finite semigroup varieties of the form V*D