Implication of regular expressions

DOI10.1016/J.AML.2011.12.009zbMATH Open1246.68148OpenAlexW2090557973MaRDI QIDQ452941FDOQ452941

Authors Alex Thomo

Publication date 18 September 2012

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2011.12.009

zbMATH Keywords

complexityincomplete informationregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Recommendations

• Disjoint pattern matching and implication in strings
• The complexity of regular(-like) expressions
• Regular expressions: new results and open problems
• The complexity of regular(-like) expressions
• The inclusion problem for regular expressions

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Disjoint pattern matching and implication in strings
• One-unambiguous regular languages

Cited in

(3)

• Fault-tolerant computation of distributed regular path queries
• Disjoint pattern matching and implication in strings
• Quantitative Verification of Stochastic Regular Expressions

This page was built for publication: Implication of regular expressions

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