![[img]](https://epub.uni-regensburg.de/style/images/fileicons/application_pdf.png) | Lizenz: Creative Commons Namensnennung 4.0 International PDF - Veröffentlichte Version (4MB) |
- URN zum Zitieren dieses Dokuments:
- urn:nbn:de:bvb:355-epub-746058
- DOI zum Zitieren dieses Dokuments:
- 10.5283/epub.74605
Zusammenfassung
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 ...
Nur für Besitzer und Autoren: Kontrollseite des Eintrags
Downloadstatistik