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.
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Some decisional problems on rational relations (Q1390853) (← links)
- Simple splicing systems (Q1392573) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Sur les monoides dont tous les groupes sont resolubles (Q1838586) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Bilateral locally testable languages. (Q1874423) (← links)
- Unary algebras, semigroups and congruences on free semigroups (Q1882916) (← links)
- Vectorial languages and linear temporal logic (Q1884965) (← links)
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups (Q1905975) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- Weighted automata and weighted logics (Q2373736) (← 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)
- Locally testable languages (Q2554236) (← links)
- Positive varieties of tree languages (Q2576866) (← links)
- The many faces of a translation (Q2581761) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← 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)
- Weak Second‐Order Arithmetic and Finite Automata (Q3287248) (← 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)