On the deficit of a finite set of words
From MaRDI portal
Publication:1822632
DOI10.1007/BF02573374zbMath0679.20049MaRDI QIDQ1822632
Publication date: 1990
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/135032
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
A string-matching interpretation of the equation \(x^ m y^ n = z^ p\), On the rank of the subsets of a free monoid, Deciding whether a finite set of words has rank at most two
Cites Work
- On the defect theorem and simplifiability
- Sur le théorème du defaut
- Sur la détermination du rang d'une équation dans le monoide libre
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Elementariness of a finite set of words is co-NP-complete
- Tests for unique decipherability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item