On finite monoids having only trivial subgroups
From MaRDI portal
Publication:5339335
DOI10.1016/S0019-9958(65)90108-7zbMath0131.02001WikidataQ55879853 ScholiaQ55879853MaRDI QIDQ5339335
Publication date: 1965
Published in: Information and Control (Search for Journal in Brave)
Related Items
Modulo-counting quantifiers over finite trees, Towards a language theory for infinite N-free pomsets., Bilateral locally testable languages., Star-free sets of integers, Characterizations of some classes of regular events, Unary algebras, semigroups and congruences on free semigroups, Pointlike sets and separation: a personal perspective, Carathéodory extensions of subclasses of regular languages, Regular languages of thin trees, Vectorial languages and linear temporal logic, An extension of the wreath product principle for finite Mazurkiewicz traces, Canonical finite models of Kleene algebra with tests, Efficient algorithms for membership in Boolean hierarchies of regular languages, The word problem for omega-terms over the Trotter-Weil hierarchy, The annulation threshold for partially monotonic automata, Left and right negatively orderable semigroups and a one-sided version of Simon's theorem, Polynomial closure and unambiguous product, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Languages polylog-time reducible to dot-depth 1/2, Semigroups and languages of dot-depth two, Two algebraic approaches to variants of the concatenation product, The complexity of intersecting finite automata having few final states, Problems on finite automata and the exponential time hypothesis, Families of recognizable sets corresponding to certain varieties of finite monoids, Inverse monoids of dot-depth two, Applications of realizations (aka linearizations) to free probability, Monoides pointes, Linear circuits, two-variable logic and weakly blocked monoids, Some decisional problems on rational relations, Simple splicing systems, An algebraic approach to data languages and timed languages, A survey on the local divisor technique, Series formelles et algèbres syntactiques, Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata., Schützenberger and Eilenberg theorems for words on linear orderings, Languages of R-trivial monoids, A generalization of the Schützenberger product of finite monoids, Automata and logics over finitely varying functions, Classification of finite monoids: the language approach, Nondeterministic state complexity of star-free languages, Products of languages with counter, On aperiodic and star-free formal power series in partially commuting variables, Towards a pseudoequational proof theory, Complete systems of \(\mathcal B\)-rational identities, Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups, The expressivity of autosegmental grammars, The dual equivalence of equations and coequations for automata, A note on the commutative closure of star-free languages, Logical definability on infinite traces, Regular languages and Stone duality, Regular languages in \(NC\), Star-free trace languages, Dynamical systems in categories, \(NC^ 1\): The automata-theoretic viewpoint, On a conjecture concerning dot-depth two languages, Games, equations and dot-depth two monoids, Equations and dot-depth one, More languages of generalised star height 1, Gröbner-Shirshov bases of some monoids., Some results on the dot-depth hierarchy, Some results on the generalized star-height problem, Local temporal logic is expressively complete for cograph dependence alphabets, Synchronizing generalized monotonic automata, The Burnside problem for semigroups, Descriptional and computational complexity of finite automata -- a survey, Expressive power of existential first-order sentences of Büchi's sequential calculus, Star-free languages are Church-Rosser congruential, Logic and rational languages of words indexed by linear orderings, A generalization of finiteness, Properties of code events and homomorphisms over regular events, Classes of languages generated by the Kleene star of a word, The dot-depth hierarchy of star-free languages is infinite, Local testability from words to traces, a suitable definition, La finitude des représentations linéaires des semi-groupes est decidable, Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices, Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini, Variétés de langages et opérations, Cyclotomic polynomials and unions of groups, The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids, A conjugacy invariant for reducible sofic shifts and its semigroup characterizations, Classifying regular languages by a split game, Trees, congruences and varieties of finite semigroups, Logic, semigroups and automata on words, Weighted automata and multi-valued logics over arbitrary bounded lattices, Games, equations and the dot-depth hierarchy, Alternating finite automata and star-free languages, Programs over semigroups of dot-depth one, LANGAGE: A Maple package for automaton characterization of regular languages, Sur les monoides dont tous les groupes sont resolubles, On relation between linear temporal logic and quantum finite automata, Algebraic tools for the concatenation product., Almost finite expansions of arbitrary semigroups, An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic, Star-free sets of words on ordinals, Non-uniform automata over groups, Equations and monoid varieties of dot-depth one and two, On the expressive power of temporal logic for infinite words, Logic over words on denumerable ordinals, Finite-automaton aperiodicity is PSPACE-complete, On a complete set of generators for dot-depth two, A NEW PROOF OF SCHUTZENBERGER'S THEOREM, Strongly locally testable semigroups with commuting idempotents and related languages, On the expressive power of temporal logic, Limited Set quantifiers over Countable Linear Orderings, Weighted automata and weighted logics, On Decidability of Intermediate Levels of Concatenation Hierarchies, Complexity Analysis: Transformation Monoids of Finite Automata, First-order properties of trees, star-free expressions, and aperiodicity, Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\)., Axiomatizing recursion-free, regular monitors, Unnamed Item, Polynomial closure and unambiguous product, An aperiodicity problem for multiwords, The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups, Measuring power of locally testable languages, Concatenation hierarchies: new bottle, old wine, Learning from positive and negative examples: dichotomies and parameterized algorithms, Inclusion relations between some congruences related to the dot-depth hierarchy, Finite loops recognize exactly the regular open languages, McCammond’s normal forms for free aperiodic semigroups revisited, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, The intersection problem for finite monoids, The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy, Extensions of an idea of McNaughton, Classes of Languages Generated by the Kleene Star of a Word, Expressive Capacity of Concatenation Freeness, Alternation Hierarchies of First Order Logic with Regular Predicates, A Note on Decidable Separability by Piecewise Testable Languages, Unnamed Item, Unnamed Item, Characterizing classes of regular languages using prefix codes of bounded synchronization delay, Schützenberger-like products in non-free monoids, Sur le produit avec compteur modulo un nombre premier, The Algebraic Counterpart of the Wagner Hierarchy, On finite generation and presentability of Schützenberger products, Locally countable pseudovarieties, Deciding FO-definability of regular languages, Quantitative vs. weighted automata, Unnamed Item, Complete rewriting system for the Schützenberger product of n groups, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, Topology for Computations of Concurrent Automata, Automata, Semigroups and Recognizability of Words on Ordinals, Characterization of Logics over Ranked Tree Languages, Weak Second‐Order Arithmetic and Finite Automata, Aperiodic String Transducers, The product of rational languages, Algebraic and topological theory of languages, Hierarchies and reducibilities on regular languages related to modulo counting, On language varieties without Boolean operations, Theme and Variations on the Concatenation Product, Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages, Unnamed Item, Languages of dot-depth 3/2, IDEMPOTENT POINTLIKE SETS, Algebraic recognizability of regular tree languages, A trichotomy for regular simple path queries on graphs, On the Krohn-Rhodes Cascaded Decomposition Theorem, Actions, wreath products of \(\mathcal C\)-varieties and concatenation product., Finite semigroup varieties of the form V*D, Determination of finite automata accepting subregular languages, Imre Simon: an exceptional graduate student, Characterizing EF and EX tree logics, Pro-aperiodic monoids via saturated models, A topological approach to non-uniform complexity, A categorical duality for algebras of partial functions, The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\)., Representation theory of finite semigroups, semigroup radicals and formal language theory, Descriptional and Computational Complexity of Finite Automata, On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\)., Unnamed Item, Quantifier Alternation for Infinite Words, Profinite Monads, Profinite Equations, and Reiterman’s Theorem, GENERALIZED CONTEXTS AND n-ARY SYNTACTIC SEMIGROUPS OF TREE LANGUAGES, Schützenberger Products in a Category, Aperiodic String Transducers, Exposing graph uniformities via algebraic specification, Linear Completeness Thresholds for Bounded Model Checking, Separating regular languages with two quantifier alternations, Factorization Forests, Generic results for concatenation hierarchies, Quantum Automata Theory – A Review, Problems on Finite Automata and the Exponential Time Hypothesis, Locally testable languages, Weighted automata, Varieties, Sur une propriété d'itération des langages algébriques déterministes, State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages, Positive varieties of tree languages, The many faces of a translation, Closure properties of subregular languages under operations, The lattice of varieties of monoids, Logical definability on infinite traces, Operations on subregular languages and nondeterministic state complexity, A conjecture on the concatenation product, Power-separating regular languages, Omega-rational expressions with bounded synchronization delay, Regularity conditions for iterated shuffle on commutative regular languages, State complexity of permutation and related decision problems on alphabetical pattern constraints, Concatenation-free languages, Dual Space of a Lattice as the Completion of a Pervin Space, Unnamed Item, Weighted Automata and Weighted Logics, Rational, recognizable, and aperiodic partially lossy queue languages, A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I, Unnamed Item, New results on the generalized star-height problem, First-order logic on finite trees, Semigroup models for biochemical reaction networks, Relativized adjacency, Regularity Conditions for Iterated Shuffle on Commutative Regular Languages, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, Nondeterministic operational complexity in subregular languages, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, Shuffle product of regular languages: results and open problems, Large Aperiodic Semigroups, Positive First-order Logic on Words and Graphs, Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic, Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words, Unnamed Item, The Power-Set Construction for Tree Algebras, A Trichotomy for Regular Trail Queries, First-order separation over countable ordinals, Ramsey monoids, Eilenberg's variety theorem without Boolean operations, The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies, Unnamed Item, Circuit complexity of regular languages, Properties of graphs specified by a regular language, Reversible Regular Languages: Logical and Algebraic Characterisations, EQUATIONAL DESCRIPTIONS OF LANGUAGES, QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES, AROUND DOT-DEPTH ONE, Properties of graphs specified by a regular language, SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES, The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy, Unnamed Item, On dot-depth two, The descriptive complexity approach to LOGCFL, Eilenberg Theorems for Free, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Nondeterministic State Complexity of Star-Free Languages, The Power of Diversity, COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS, Where First-Order and Monadic Second-Order Logic Coincide, Presentations of the Schützenberger Product of n Groups, Unnamed Item, Expressive capacity of subregular expressions, On All Things Star-Free, Unnamed Item, The Quantifier Alternation Hierarchy of Synchronous Relations, On Correspondences Between Unary Algebras, Automata, Semigroups and Congruences, One quantifier alternation in first-order logic with modular predicates, Unnamed Item, Unnamed Item, Backward Deterministic Büchi Automata on Infinite Words
