The following pages link to (Q4077455):
Displayed 50 items.
- Approximate comparison of functions computed by distance automata (Q290904) (← links)
- Regular languages of thin trees (Q290908) (← links)
- Canonical finite models of Kleene algebra with tests (Q299196) (← links)
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- On the word problem for syntactic monoids of piecewise testable languages. (Q444643) (← links)
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- Behavior of digital sequences through exotic numeration systems (Q521363) (← links)
- Piecewise testable languages via combinatorics on words (Q641179) (← links)
- Normal forms under Simon's congruence (Q667852) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Non-finitely based monoids. (Q744847) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- The finite basis problem for Kiselman monoids. (Q895869) (← links)
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotents (Q913522) (← links)
- Products of languages with counter (Q917324) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis (Q1062465) (← links)
- Characterizations of some classes of regular events (Q1083210) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- On finite \(\mathcal J\)-trivial monoids (Q1140165) (← links)
- Series formelles et algèbres syntactiques (Q1144951) (← links)
- Languages of R-trivial monoids (Q1146010) (← links)
- Variétés de langages et monoide des parties (Q1147826) (← links)
- A generalization of the Schützenberger product of finite monoids (Q1150445) (← links)
- Classification of finite monoids: the language approach (Q1157412) (← links)
- Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
- On power commutative semigroups (Q1184166) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids (Q1204565) (← links)
- Some results on the dot-depth hierarchy (Q1207707) (← links)
- A generalization of finiteness (Q1236192) (← links)
- Syntaktische Monoide und Hypercodes (Q1236636) (← links)
- The dot-depth hierarchy of star-free languages is infinite (Q1242697) (← links)
- Semidirect products of pseudovarieties from the universal algebraist's point of view (Q1262958) (← links)
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids (Q1262959) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups (Q1293384) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Well quasi-orders and regular languages (Q1338899) (← links)