On the deficit of a finite set of words

DOI10.1007/BF02573374zbMath0679.20049MaRDI QIDQ1822632

Jean Néraud

Publication date: 1990

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135032

zbMATH Keywords

rankmaximal independent setsdeficitminimal dependent set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the deficit of a finite set of words