Regular prefix codes and right power-bounded languages

DOI10.1007/BF02194922MaRDI QIDQ1241492zbMATH OpenOpenAlexFDO

Authors 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) Theory of error-correcting codes and error-detecting codes (94B99) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3608316 (Why is no real title available?)
• scientific article; zbMATH DE number 3318649 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• Left-noncounting languages

Cited in

(3)

• Characterizing the regular prefix codes and right power-bounded languages
• scientific article; zbMATH DE number 3576711 (Why is no real title available?)
• Characterizations for the regular prefix codes and related families

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241492)