Pages that link to "Item:Q1822632"
From MaRDI portal
The following pages link to On the deficit of a finite set of words (Q1822632):
Displaying 6 items.
- 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)
- Defect theorems for trees (Q2708961) (← links)
- Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)
- Machines, Computations, and Universality (Q5710891) (← links)