Semi-linear Parikh Images of Regular Expressions via Reduction

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.

• Type: Journal
• Year: 2010
• Where: MFCS
• Authors: Bahareh Badban, Mohammad Torabi Dashti
• Keywords: MFCS 2010, Parikh Image, Reduction System, Regular Expression, Theoretical Computer Science