The following pages link to Languages of R-trivial monoids (Q1146010):
Displayed 11 items.
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- On generalized locally testable languages (Q760215) (← 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)
- 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)