Semi-linear Parikh Images of Regular Expressions via Reduction

DOI10.1007/978-3-642-15155-2_57MaRDI QIDQ3586120zbMATH OpenOpenAlexFDO

Authors Bahareh Badban, Mohammad Torabi Dashti

Publication date 3 September 2010

Published in Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15155-2_57

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1502115
• On a generalization of regular expressions
• Tight Bounds on the Descriptional Complexity of Regular Expressions
• Approximate regular expressions and their derivatives
• Linear pattern matching of compressed terms and polynomial rewriting
• scientific article; zbMATH DE number 7315073
• Simplifying regular expressions. A quantitative perspective
• On classes of tractable unrestricted regular expressions
• Extended regular expressions: succinctness and decidability
• Extended Regular Expressions: Succinctness and Decidability

Cited in

(3)

• A decision procedure for regular membership and length constraints over unbounded strings
• Moore reducibility for regular languages
• Resynchronizing classes of word relations

This page was built for publication: Semi-linear Parikh Images of Regular Expressions via Reduction

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