Semi-linear Parikh images of regular expressions via reduction

Authors:
Bahareh Badban;Mohammad Torabi Dashti
Affiliations:
Universität Konstanz;ETH Zürich
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 5
Cited 0

On Context-Free Languages

Journal of the ACM (JACM)
Parikh-Bounded Languages

Proceedings of the 8th Colloquium on Automata, Languages and Programming
A useful device for showing the solvability of some decision problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Linear reachability problems and minimal solutions to linear Diophantine equation systems

Theoretical Computer Science - Implementation and application of automata
On the complexity of equational horn clauses

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

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 semilinear representation for the Parikh image of the language of t.