Characterizing the regular prefix codes and right power-bounded languages

DOI10.1016/0020-0190(79)90098-XzbMath0411.68067OpenAlexW2036232991MaRDI QIDQ1259432

Paulo A. S. Veloso

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90098-x

zbMATH Keywords

regular expressionsprefix codesright power-bounded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

On pushout consistency, modularity and interpolation for logical specifications ⋮ On the Modularization Theorem for logical specifications ⋮ Relation algebras: Concept of points and representability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular prefix codes and right power-bounded languages
• Left-noncounting languages

This page was built for publication: Characterizing the regular prefix codes and right power-bounded languages