The following pages link to (Q3853827):
Displayed 50 items.
- On the topological structure of a finitely generated semigroup of matrices (Q1103733) (← links)
- Categoricity results for \(L_{\infty \kappa}\)-free algebras (Q1104924) (← links)
- Relatively f-disjunctive languages (Q1105049) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Finite biprefix sets of paths in a graph (Q1105386) (← links)
- Theory of traces (Q1107296) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- The synthesis theorem for finite regular semigroups, and its generalization (Q1110661) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- A short proof that \(\hat S^+_ A\) is finite if S is finite (Q1112180) (← links)
- Expletives in languages and middle units in semigroups (Q1113290) (← links)
- Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials) (Q1113985) (← links)
- Permutation properties and the Fibonacci semigroup (Q1114022) (← links)
- Counting with rational functions (Q1115616) (← links)
- Concatenation of inputs in a two-way automaton (Q1115636) (← links)
- A note on regular classes in special Thue systems (Q1116708) (← links)
- Characterization of idempotent transformation monoids (Q1119394) (← links)
- On a conjecture of Rhodes (Q1120685) (← links)
- Every finitely generated submonoid of a free monoid has a finite Malcev's presentation (Q1123270) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- Machines in a category (Q1142850) (← links)
- Operatorenkalkül über freien Monoiden I: Strukturen (Q1146182) (← links)
- Augmentations and wreath products of monoids (Q1147815) (← links)
- Closure operators on languages and binary relations (Q1147824) (← links)
- Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre (Q1147825) (← links)
- Semigroups with each element disjunctive (Q1149523) (← links)
- A semigroup and Gaussian polynomials (Q1155617) (← links)
- Classification of finite monoids: the language approach (Q1157412) (← links)
- On varieties of rational languages and variable-length codes (Q1161830) (← links)
- Thue congruences and the Church-Rosser property (Q1162505) (← links)
- On a special monoid with a single defining relation (Q1162607) (← links)
- Baionnettes et cardinaux (Q1164715) (← links)
- On the syntactic transformation semigroup of a language generated by a finite biprefix code (Q1165022) (← links)
- A synchronization property of pure subsemigroups of a free semigroup (Q1165591) (← links)
- Finite DOL languages and codes (Q1168747) (← links)
- Unions of groups of small height (Q1172704) (← links)
- A finiteness condition for semigroups generalizing a theorem of Hotzel (Q1173706) (← links)
- Topologies for the free monoid (Q1173729) (← links)
- On the determination of Green's relations in finite transformation semigroups (Q1173774) (← links)
- Counting monoids and rational languages (Q1176625) (← links)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products (Q1177141) (← links)
- Finiteness and iteration conditions for semigroups (Q1177143) (← links)
- Languages and scanners (Q1177931) (← links)
- Which Kleene semigroups are finite? (Q1178693) (← links)