Regular prefix codes and right power-bounded languages

DOI10.1007/BF02194922zbMath0364.94094OpenAlexW2025141546MaRDI QIDQ1241492

Gabriel Thierrin

Publication date: 1976

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

Unnamed Item ⋮ Characterizing the regular prefix codes and right power-bounded languages ⋮ Characterizations for the regular prefix codes and related families

Cites Work

• Left-noncounting languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular prefix codes and right power-bounded languages