Overlap-Free Regular Languages

DOI10.1007/11809678_49MaRDI QIDQ3591303zbMATH OpenOpenAlexFDO

Authors Yo-Sub Han, D. Wood

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_49

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Overlap-free words and finite automata
• Overlap-free languages and solid codes
• Prefix-free regular languages and pattern matching
• scientific article; zbMATH DE number 7315105
• Regular patterns, regular languages and context-free languages
• scientific article; zbMATH DE number 4009839
• Regular languages of words over countable linear orderings
• Complexity of suffix-free regular languages
• Complexity of suffix-free regular languages
• Regular languages and partial commutations

Cited in

(4)

• Overlap-free words and finite automata
• Automata for solid codes
• Prefix-free regular languages and pattern matching
• Outfix-free regular languages and prime outfix-free decomposition

This page was built for publication: Overlap-Free Regular Languages

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