Pages that link to "Item:Q1090421"
From MaRDI portal
The following pages link to On the defect theorem and simplifiability (Q1090421):
Displaying 15 items.
- Relativized codes (Q418759) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← 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)
- A note on decidability questions on presentations of word semigroups (Q1391138) (← links)
- Multiple factorizations of words and defect effect (Q1605328) (← links)
- On the deficit of a finite set of words (Q1822632) (← links)
- Cumulative defect. (Q1853734) (← links)
- A defect theorem for bi-infinite words. (Q1853742) (← links)
- Many aspects of defect theorems (Q1882912) (← links)
- The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
- Primitive sets of words (Q2662680) (← links)
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
- Compactness of systems of equations in semigroups (Q4645199) (← links)
