MFCS Conference 2010 Conference Paper
Semi-linear Parikh Images of Regular Expressions via Reduction
- Bahareh Badban
- Muhammad Torabi Dashti
Abstract A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readily yields a semi-linear representation for the Parikh image of the language of t.