A Constraint Solving Approach to Parikh Images of Regular Languages

URN to cite this document:: urn:nbn:de:bvb:355-epub-746058
DOI to cite this document:: 10.5283/epub.74605

Stjerna, Amanda ; Rümmer, Philipp

License: Creative Commons Attribution 4.0
PDF - Published Version
(4MB)

Date of publication of this fulltext: 09 Jan 2025 14:03

Alternative links to fulltext:DOI Publisher

Details

Preview

Export bibliographical data

Abstract

A common problem in string constraint solvers is computing the Parikh image, a linear arithmetic formula that describes all possible combinations of character counts in strings of a given language. Automata-based string solvers frequently need to compute the Parikh image of products (or intersections) of finite-state automata, in particular when solving string constraints that also include the ...