The following pages link to Sur le théorème du defaut (Q1132974):
Displaying 32 items.
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- A three-word code which is not prefix-suffix composed (Q671357) (← links)
- A note on intersections of free submonoids of a free monoid (Q760507) (← links)
- Some algorithms on the star operation applied to finite languages (Q794778) (← links)
- Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre (Q797700) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On the defect theorem and simplifiability (Q1090421) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← links)
- The meet operation in the lattice of codes (Q1127316) (← links)
- Sur la détermination du rang d'une équation dans le monoide libre (Q1161827) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- On the rank of the subsets of a free monoid (Q1193899) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- On the deficit of a finite set of words (Q1822632) (← links)
- On the lattice of prefix codes. (Q1853555) (← links)
- A defect theorem for bi-infinite words. (Q1853742) (← links)
- Binary equality sets are generated by two words (Q1867297) (← links)
- Many aspects of defect theorems (Q1882912) (← links)
- The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Primitive sets of words (Q2662680) (← links)
- Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)
- Compatibility relations on codes and free monoids (Q3526416) (← links)
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS (Q4464961) (← links)
- On codes with finite interpreting delay: a defect theorem (Q4494481) (← links)
- Codes and equations on trees (Q5941083) (← links)
- Recognizability of morphisms (Q6068415) (← links)
- Binary codes that do not preserve primitivity (Q6111526) (← links)
- Zigzag codes and \(z\)-free hulls (Q6567686) (← links)
