On the Dual Post Correspondence Problem. - Joel D. Day; Daniel Reidenbach; Johannes C. Schneider (Int. J. Found. Comput. Sci., 2014)

Ambiguity of Morphisms in a Free Group. - Joel D. Day; Daniel Reidenbach (WORDS, 2015)

Periodicity forcing words. - Joel D. Day; Daniel Reidenbach; Johannes C. Schneider (Theor. Comput. Sci., 2015)

On restricting the ambiguity in morphic images of words. - Joel D. Day (2016)

Local Patterns. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (FSTTCS, 2017)

The Hardness of Solving Simple Word Equations. - Joel D. Day; Florin Manea; Dirk Nowotka (MFCS, 2017)

Closure properties of pattern languages. - Joel D. Day; Daniel Reidenbach; Markus L. Schmid (J. Comput. Syst. Sci., 2017)

On Matching Generalised Repetitive Patterns. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka; Markus L. Schmid (DLT, 2018)

The Satisfiability of Word Equations: Decidable and Undecidable Theories. - Joel D. Day; Vijay Ganesh 001; Paul He; Florin Manea; Dirk Nowotka (RP, 2018)

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability. - Joel D. Day; Vijay Ganesh 001; Paul He; Florin Manea; Dirk Nowotka (CoRR, 2018)

k-Spectra of Weakly-c-Balanced Words. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (DLT, 2019)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. - Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid (ICALP, 2019)

Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. - Joel D. Day; Florin Manea; Dirk Nowotka (MFCS, 2019)

On Solving Word Equations Using SAT. - Joel D. Day; Thorsten Ehlers; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (RP, 2019)

k-Spectra of c-Balanced Words. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (CoRR, 2019)

Rule-based Word Equation Solving. - Joel D. Day; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (FormaliSE@ICSE, 2020)

A Length-aware Regular Expression SMT Solver. - Murphy Berzish; Mitja Kulczynski; Federico Mora 002; Florin Manea; Joel D. Day; Dirk Nowotka; Vijay Ganesh 001 (CoRR, 2020)

Equations enforcing repetitions under permutations. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (Discret. Appl. Math., 2020)

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length. - Murphy Berzish; Mitja Kulczynski; Federico Mora 002; Florin Manea; Joel D. Day; Dirk Nowotka; Vijay Ganesh 001 (CAV (2), 2021)

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back. - Murphy Berzish; Joel D. Day; Vijay Ganesh 001; Mitja Kulczynski; Florin Manea; Federico Mora 002; Dirk Nowotka (WORDS, 2021)

Word Equations in the Context of String Solving. - Joel D. Day (DLT, 2022)

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. - Joel D. Day; Maria Kosche; Florin Manea; Markus L. Schmid (ISAAC, 2022)

Formal Languages via Theories over Strings. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Florin Manea (CoRR, 2022)

A Generic Information Extraction System for String Constraints. - Joel D. Day; Adrian Kröger; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (CoRR, 2022)

Unambiguous injective morphisms in free groups. - Joel D. Day; Daniel Reidenbach (Inf. Comput., 2022)

Formal Languages via Theories over Strings: An Overview of Some Recent Results. - Joel D. Day; Vijay Ganesh 001; Florin Manea (Bull. EATCS, 2023)

Towards more efficient methods for solving regular-expression heavy string constraints. - Murphy Berzish; Joel D. Day; Vijay Ganesh 001; Mitja Kulczynski; Florin Manea; Federico Mora 002; Dirk Nowotka (Theor. Comput. Sci., 2023)

On the Expressive Power of String Constraints. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Florin Manea (Proc. ACM Program. Lang., 2023)

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. - Zhengyang Lu 002; Stefan Siemer; Piyush Jha; Joel D. Day; Florin Manea; Vijay Ganesh 001 (IJCAI, 2024)

A Closer Look at the Expressive Power of Logics Based on Word Equations. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Matthew Konefal; Florin Manea (Theory Comput. Syst., 2024)

On the structure of solution-sets to regular word equations. - Joel D. Day; Florin Manea (Theory Comput. Syst., 2024)

FC-Datalog as a Framework for Efficient String Querying. - Owen M. Bell; Joel D. Day; Dominik D. Freydenberger (ICDT, 2025)

The edit distance to k-subsequence universality. - Joel D. Day; Pamela Fleischmann; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (J. Comput. Syst. Sci., 2025)