Simple regular expressions and languages

DOI10.25596/JALC-2007-181MaRDI QIDQ3517103zbMATH OpenFDO

Authors Yo-Sub Han, Gerhard Trippen, D. Wood

Publication date 12 August 2008

Full work available at URL https://doi.org/10.25596/JALC-2007-181

zbMATH Keywords

descriptional complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• State complexity of basic operations on suffix-free regular languages
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• Descriptional complexity of regular languages
• Operational state complexity of prefix-free regular languages

Cited in

(2)

• Inside the Class of REGEX Languages
• Outfix-free regular languages and prime outfix-free decomposition

This page was built for publication: Simple regular expressions and languages

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