Overlap-free languages and solid codes

DOI10.1142/S0129054111008647MaRDI QIDQ3173944zbMATH OpenFDO

Authors Yo-Sub Han, Kai Salomaa

Publication date 10 October 2011

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

zbMATH Keywords

regular languagesprimalitysolid 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)

Recommendations

• Publication:5750815
• Some combinatorial properties of solid codes
• The applications of solid codes to r-R and r-D languages
• Finite maximal solid codes
• Maximal solid codes

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• n-Prefix–suffix languages^∗
• A variant of a recursively unsolvable problem
• Derivatives of Regular Expressions
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Introduction to algorithms
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• Outfix and infix codes and related classes of languages

Cited in

(7)

• Automata for solid codes
• scientific article; zbMATH DE number 4185539 (Why is no real title available?)
• Overlapping words, codes, disjunctivity and density of languages
• The applications of solid codes to r-R and r-D languages
• Overlap-Free Regular Languages
• On f-Disjunctive Languages, f-Disjunctive Domains and Solid Codes
• Decision problems for subregular classes

This page was built for publication: Overlap-free languages and solid codes

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