On the rank of the subsets of a free monoid

DOI10.1016/0304-3975(92)90350-OzbMath0779.20037MaRDI QIDQ1193899

Jean Néraud

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

iterationrankfree monoiddefect theoremcatenationword monoid

Mathematics Subject Classification ID

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

Related Items (2)

Primitive sets of words ⋮ 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
• On the deficit of a finite set of words
• Elementariness of a finite set of words is co-NP-complete
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the rank of the subsets of a free monoid