The inclusion problem for regular expressions

DOI10.1007/978-3-642-13089-2_26zbMATH Open1284.68354OpenAlexW1523753320WikidataQ56638420 ScholiaQ56638420MaRDI QIDQ3564873FDOQ3564873

Authors: Dag Hovland 

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1956/3956

Recommendations

• The inclusion problem for regular expressions
• Inclusion Test Algorithms for One-Unambiguous Regular Expressions
• scientific article; zbMATH DE number 871439
• From regular expressions to deterministic automata
• scientific article; zbMATH DE number 1740166

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Cited In (4)

• Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
• Inclusion Test Algorithms for One-Unambiguous Regular Expressions
• Implication of regular expressions
• The inclusion problem for regular expressions

This page was built for publication: The inclusion problem for regular expressions

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