Pages that link to "Item:Q5339335"
From MaRDI portal
The following pages link to On finite monoids having only trivial subgroups (Q5339335):
Displayed 50 items.
- Weak Second‐Order Arithmetic and Finite Automata (Q3287248) (← links)
- (Q3304129) (← links)
- (Q3304144) (← links)
- Limited Set quantifiers over Countable Linear Orderings (Q3449472) (← links)
- On Decidability of Intermediate Levels of Concatenation Hierarchies (Q3451089) (← links)
- Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- The Algebraic Counterpart of the Wagner Hierarchy (Q3507423) (← links)
- On finite generation and presentability of Schützenberger products (Q3507541) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- On the Krohn-Rhodes Cascaded Decomposition Theorem (Q3587258) (← links)
- Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Factorization Forests (Q3637210) (← links)
- (Q3679403) (← links)
- (Q3913600) (← links)
- Sur une propriété d'itération des langages algébriques déterministes (Q3925891) (← links)
- First-order properties of trees, star-free expressions, and aperiodicity (Q3978766) (← links)
- Sur le produit avec compteur modulo un nombre premier (Q4032305) (← links)
- Strongly locally testable semigroups with commuting idempotents and related languages (Q4256142) (← links)
- Topology for Computations of Concurrent Automata (Q4354233) (← links)
- Automata, Semigroups and Recognizability of Words on Ordinals (Q4354234) (← links)
- Algebraic and topological theory of languages (Q4362276) (← links)
- (Q4453869) (← links)
- (Q4453870) (← links)
- (Q4558789) (← links)
- Finite loops recognize exactly the regular open languages (Q4571944) (← links)
- (Q4580330) (← links)
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay (Q4588867) (← links)
- Complete rewriting system for the Schützenberger product of n groups (Q4621410) (← links)
- Logical definability on infinite traces (Q4630272) (← links)
- The product of rational languages (Q4630281) (← links)
- Polynomial closure and unambiguous product (Q4645191) (← links)
- IDEMPOTENT POINTLIKE SETS (Q4658707) (← links)
- Imre Simon: an exceptional graduate student (Q4680741) (← links)
- Aperiodic String Transducers (Q4683232) (← links)
- Exposing graph uniformities via algebraic specification (Q4712581) (← links)
- Power-separating regular languages (Q4775487) (← links)
- A NEW PROOF OF SCHUTZENBERGER'S THEOREM (Q4786245) (← links)
- Schützenberger-like products in non-free monoids (Q4850325) (← links)
- EQUATIONAL DESCRIPTIONS OF LANGUAGES (Q4923277) (← links)
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279) (← links)
- AROUND DOT-DEPTH ONE (Q4923283) (← links)
- Weighted Automata and Weighted Logics (Q5072547) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- (Q5079753) (← links)
- Eilenberg Theorems for Free (Q5111258) (← links)
- (Q5129940) (← links)