The following pages link to Languages of R-trivial monoids (Q1146010):
Displaying 26 items.
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- On generalized locally testable languages (Q760215) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Two algebraic approaches to variants of the concatenation product (Q861283) (← links)
- Products of languages with counter (Q917324) (← links)
- Languages of R-trivial monoids (Q1146010) (← links)
- Classification of finite monoids: the language approach (Q1157412) (← links)
- Recognizable languages and congruences (Q1172156) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- Left and right negatively orderable semigroups and a one-sided version of Simon's theorem (Q1644738) (← links)
- The \(\kappa\)-word problem over \(\mathsf{DRH}\) (Q1676315) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Complexity of deciding detectability in discrete event systems (Q1797011) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Geometrically closed positive varieties of languages (Q2084767) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Directed nonabelian sandpile models on trees (Q2339194) (← links)
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data (Q2508967) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids (Q3126014) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups (Q6170751) (← links)
