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.
- The lattice of varieties of monoids (Q2105481) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- On language varieties without Boolean operations (Q2232259) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- Concatenation-free languages (Q2357107) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- Weighted automata and weighted logics (Q2373736) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. (Q2490810) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\). (Q2514861) (← links)
- On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\). (Q2516602) (← links)
- Locally testable languages (Q2554236) (← links)
- Positive varieties of tree languages (Q2576866) (← links)
- The many faces of a translation (Q2581761) (← links)
- Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\). (Q2631310) (← links)
- Locally countable pseudovarieties (Q2687295) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Profinite Monads, Profinite Equations, and Reiterman’s Theorem (Q2811362) (← links)
- Schützenberger Products in a Category (Q2817378) (← links)
- Aperiodic String Transducers (Q2817381) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- McCammond’s normal forms for free aperiodic semigroups revisited (Q2940603) (← links)
- Classes of Languages Generated by the Kleene Star of a Word (Q2946333) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- GENERALIZED CONTEXTS AND n-ARY SYNTACTIC SEMIGROUPS OF TREE LANGUAGES (Q3084665) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- A conjecture on the concatenation product (Q3147025) (← links)