Overlap-free languages and solid codes

DOI10.1142/S0129054111008647zbMATH Open1222.68105MaRDI QIDQ3173944FDOQ3173944

Kai Salomaa, Yo-Sub Han

Publication date: 10 October 2011

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

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

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)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Title not available (Why is that?)
• A variant of a recursively unsolvable problem
• Outfix and infix codes and related classes of languages
• Title not available (Why is that?)
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• n-Prefix–suffix languages^∗

Cited In (6)

• Automata for solid codes
• Overlapping words, codes, disjunctivity and density of languages
• Overlap-Free Regular Languages
• On f-Disjunctive Languages, f-Disjunctive Domains and Solid Codes
• Title not available (Why is that?)
• 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)