Pages that link to "Item:Q5339335"
From MaRDI portal
The following pages link to On finite monoids having only trivial subgroups (Q5339335):
Displayed 43 items.
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- (Q5155668) (← links)
- (Q5155687) (← links)
- Reversible Regular Languages: Logical and Algebraic Characterisations (Q5158652) (← links)
- SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES (Q5173287) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- The Power of Diversity (Q5200079) (← links)
- (Q5216308) (← links)
- Expressive capacity of subregular expressions (Q5223616) (← links)
- (Q5232909) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- Dual Space of a Lattice as the Completion of a Pervin Space (Q5283200) (← links)
- A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I (Q5321775) (← links)
- (Q5376662) (← links)
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS (Q5462675) (← links)
- Presentations of the Schützenberger Product of <i>n</i> Groups (Q5469989) (← links)
- On Correspondences Between Unary Algebras, Automata, Semigroups and Congruences (Q5483345) (← links)
- (Q5576262) (← links)
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy (Q5740189) (← links)
- Large Aperiodic Semigroups (Q5744128) (← links)
- On dot-depth two (Q5750405) (← links)
- (Q5875342) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- Properties of graphs specified by a regular language (Q5896894) (← links)
- Properties of graphs specified by a regular language (Q5918788) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- Semigroup models for biochemical reaction networks (Q6038681) (← links)
- Relativized adjacency (Q6053841) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words (Q6098157) (← links)
- Shuffle product of regular languages: results and open problems (Q6108717) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)
- The Power-Set Construction for Tree Algebras (Q6178675) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)
- First-order separation over countable ordinals (Q6181932) (← links)
- Ramsey monoids (Q6186128) (← links)
- Eilenberg's variety theorem without Boolean operations (Q6186309) (← links)
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies (Q6195308) (← links)