Conferences
Day, J, Ganesh, V, Grewal, N, Manea, F (2023)
On the expressive power of string constraints. In
50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023); Proceedings of the ACM on Programming Languages, Boston, Massachusetts, United States, pp.278-308, DOI:
10.1145/3571203.
Day, JD, Kosche, M, Manea, F, Schmid, ML (2022)
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. In
, Leibniz International Proceedings in Informatics, LIPIcs,ISBN: 9783959772587. DOI:
10.4230/LIPIcs.ISAAC.2022.64.
Day, JD (2022)
Word Equations in the Context of String Solving. In
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp.13-32, ISBN: 9783031055775. DOI:
10.1007/978-3-031-05578-2_2.
Berzish, M, Kulczynski, M, Mora, F, Manea, F,
Day, J, Nowotka, D, Ganesh, V (2021)
An SMT solver for regular expressions and linear arithmetic over string length. In Silva, A and Leino, KRM (ed)
33rd International Conference on Computer-Aided Verification (CAV 2021); Computer Aided Verification, Online, pp.289-312, ISBN: 9783030816872. DOI:
10.1007/978-3-030-81688-9_14.
Day, J, Fleischmann, P, Kosche, M, Koss, T, Manea, F, Siemer, S (2021)
The edit distance to k-subsequence universality. In Bläser, M and Monmege, B (ed)
38th International Symposium on Theoretical Aspects of Computer Science (STACS); 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), ELECTR NETWORK, pp.1-25, ISBN: 9783959771801. DOI:
10.4230/LIPIcs.STACS.2021.25.
Berzish, M,
Day, J, Ganesh, V, Kulczynski, M, Manea, F, Mora, F, Nowotka, D (2021)
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back. In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp.50-64, ISBN: 9783030850876. DOI:
10.1007/978-3-030-85088-3_5.
Day, JD, Kulczynski, M, Manea, F, Nowotka, D, Poulsen, DB (2020)
Rule-based word equation solving. In
, Proceedings - 2020 IEEE/ACM 8th International Conference on Formal Methods in Software Engineering, FormaliSE 2020, pp.87-97, ISBN: 9781450370714. DOI:
10.1145/3372020.3391556.
Day, J and Manea, F (2020)
On the structure of solution sets to regular word equations. In Czumaj, A, Dawar, A, Merelli, E (ed)
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany,ISBN: 9783959771382. DOI:
10.4230/LIPIcs.ICALP.2020.124.
Day, J, Ehlers, T, Kulczynski, M, Manea, F, Nowotka, D, Poulsen, DB (2019)
On solving word equations using SAT. In Filiot, E, Jungers, R, Potapov, I (ed)
International Conference on Reachability Problems (RP 2019); Reachability Problems, Brussels, Belgium, pp.93-106, ISBN: 9783030308056. DOI:
10.1007/978-3-030-30806-3_8.
Day, JD, Manea, F, Nowotka, D (2019)
Upper bounds on the length of minimal solutions to certain quadratic word equations. In
, Leibniz International Proceedings in Informatics, LIPIcs,ISBN: 9783959771177. DOI:
10.4230/LIPIcs.MFCS.2019.44.
Day, J, Fleischmann, P, Manea, F, Nowotka, D (2019)
k-spectra of weakly-c-balanced words. In Hofman, P and Skrzypczak, M (ed)
International Conference on Developments in Language Theory (DLT 2019); Developments in Language Theory, Warsaw, Poland, pp.265-277, ISBN: 9783030248857. DOI:
10.1007/978-3-030-24886-4_20.
Casel, K,
Day, JD, Fleischmann, P, Kociumaka, T, Manea, F, Schmid, ML (2019) Graph and string parameters: Connections between pathwidth, cutwidth and the locality number. In
, Leibniz International Proceedings in Informatics, LIPIcs,ISBN: 9783959771092.
Day, J, Ganesh, V, He, P, Manea, F, Nowotka, D (2018)
The Satisfiability of Word Equations: Decidable and Undecidable Theories. In Potapov, I and Reynier, P-A (ed)
International Conference on Reachability Problems, Marseille, France. DOI:
10.1007/978-3-030-00250-3_2.
Day, J, Manea, F, Nowotka, D, Fleischmann, P, Schmid, ML (2018)
On Matching Generalised Repetitive Patterns. In Seki, S and Hoshi, M (ed)
International Conference on Developments in Language Theory, Tokyo, Japan. DOI:
10.1007/978-3-319-98654-8_22.
Day, J, Fleischmann, P, Manea, F, Nowotka, D (2018)
Local Patterns. In
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Kanpur, India. DOI:
10.4230/LIPIcs.FSTTCS.2017.24.
Day, J, Manea, F, Nowotka, D (2017)
The hardness of solving simple word equations. In
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aalborg, Denmark, pp.1-18, ISBN: 9783959770460. DOI:
10.4230/LIPIcs.MFCS.2017.18.
Day, J, Manea, F, Fleischmann, P, Nowotka, D (2017)
Equations Enforcing Repetitions Under Permutations. In Brlek, S, Dolce, F, Vandomme, É, Reutenauer, C (ed)
International Conference on Combinatorics on Words, Montreal, Canada. DOI:
10.1007/978-3-319-66396-8_8.
Day, JD and Reidenbach, D (2015)
Ambiguity of Morphisms in a Free Group. In
10th International Conference on Words, WORDS 2015, Kiel, Germany, pp.97-108, ISBN: 978-3-319-23659-9. DOI:
10.1007/978-3-319-23660-5_9.
Day, J, Reidenbach, D, Schmid, ML (2014)
Closure properties of pattern languages. In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp.279-290, ISBN: 9783319096971. DOI:
10.1007/978-3-319-09698-8_25.
Day, J, Reidenbach, D, Schneider, JC (2013)
Periodicity forcing words. In
,ISBN: 9783642405785. DOI:
10.1007/978-3-642-40579-2-13.
Day, J, Reidenbach, D, Schneider, JC (2013)
On the dual post correspondence problem. In
,ISBN: 9783642387708. DOI:
10.1007/978-3-642-38771-5_16.
