OVERLAP-FREE LANGUAGES AND SOLID CODES

DOI10.1142/S0129054111008647zbMath1222.68105MaRDI QIDQ3173944

Kai Salomaa, Yo-Sub Han

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

primalityregular languagessolid codesoverlap-freeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Automata for solid codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outfix and infix codes and related classes of languages
• n-Prefix–suffix languages^∗
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Derivatives of Regular Expressions
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• A variant of a recursively unsolvable problem

This page was built for publication: OVERLAP-FREE LANGUAGES AND SOLID CODES