Right \(k\)-dense languages

DOI10.1007/BF02573680zbMath0829.20092MaRDI QIDQ1322582

Shyr-Shen Yu, Masami Ito, Gabriel Thierrin

Publication date: 17 January 1996

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

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

zbMATH Keywords

free monoidsdescending chains of minimal right \(m\)- dense languagesmaximal prefix codesminimal right \(k\)-dense languagesminimal right \(k\)-dense submonoids

Mathematics Subject Classification ID

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

Related Items (2)

On the robustness of primitive words ⋮ Post-plus languages

Cites Work

• Outfix and infix codes and related classes of languages
• Codes conjugués
• Unnamed Item
• Unnamed Item

This page was built for publication: Right \(k\)-dense languages