String theories involving regular membership predicates: from practice to theory and back
From MaRDI portal
Publication:2140459
DOI10.1007/978-3-030-85088-3_5OpenAlexW3201395094MaRDI QIDQ2140459
Federico Mora, Vijay Ganesh, Murphy Berzish, Joel D. Day, Mitja Kulczynski, Dirk Nowotka, Florin Manea
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/2105.07220
Related Items (3)
An SMT solver for regular expressions and linear arithmetic over string length ⋮ String theories involving regular membership predicates: from practice to theory and back ⋮ Towards more efficient methods for solving regular-expression heavy string constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- An SMT solver for regular expressions and linear arithmetic over string length
- Finite automata and unary languages
- The satisfiability of word equations: decidable and undecidable theories
- String theories involving regular membership predicates: from practice to theory and back
- On solving word equations using SAT
- More Than 1700 Years of Word Equations
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Chrobak Normal Form Revisited, with Applications
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
This page was built for publication: String theories involving regular membership predicates: from practice to theory and back
