Outfix-free regular languages and prime outfix-free decomposition

MaRDI QIDQ5445181zbMATH OpenFDO

Authors Yo-Sub Han, D. Wood

Publication date 3 March 2008

zbMATH Keywords

outfix-freenessprime decompositionregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Theoretical Aspects of Computing – ICTAC 2005
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• scientific article; zbMATH DE number 4051030
• Overlap-Free Regular Languages
• Simple regular expressions and languages

Cited in

(2)

• Every regular bifix code is a finite union of regular infix codes
• Theoretical Aspects of Computing – ICTAC 2005

This page was built for publication: Outfix-free regular languages and prime outfix-free decomposition

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