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 QIDQ2140459FDOQ2140459
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
Recommendations
- Solving String Theories Involving Regular Membership Predicates Using SAT
- A formal framework for stringology
- scientific article; zbMATH DE number 776040
- scientific article; zbMATH DE number 7300355
- Some properties of type \(\text{I}'\) string theory
- Towards string predictions
- σ-MODELS AND STRING THEORIES
- From the \(S\)-matrix to string theory
- From the \(S\)-matrix to string theory
Cites Work
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Finite automata and unary languages
- Chrobak Normal Form Revisited, with Applications
- Title not available (Why is that?)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- The satisfiability of word equations: decidable and undecidable theories
- String theories involving regular membership predicates: from practice to theory and back
- An SMT solver for regular expressions and linear arithmetic over string length
- Title not available (Why is that?)
- On solving word equations using SAT
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
- More Than 1700 Years of Word Equations
- Title not available (Why is that?)
Cited In (5)
- An SMT solver for regular expressions and linear arithmetic over string length
- Solving String Theories Involving Regular Membership Predicates Using SAT
- String theories involving regular membership predicates: from practice to theory and back
- Towards more efficient methods for solving regular-expression heavy string constraints
- Solving string constraints using SAT
Uses Software
This page was built for publication: String theories involving regular membership predicates: from practice to theory and back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140459)
