| 2020 | Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words. | Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza |
| 2020 | Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions. | Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden |
| 2020 | $\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. | Alexis Bs, Christian Choffrut |
| 2020 | Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle. | Dmitry Berdinsky, Prohrak Kruengthomya |
| 2020 | On the Weisfeiler-Leman Dimension of Fractional Packing. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2020 | On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. | Kazuyuki Amano |
| 2020 | The New Complexity Landscape Around Circuit Minimization. | Eric Allender |
| 2019 | Tight Bounds on the Minimum Size of a Dynamic Monopoly. | Ahad N. Zehmakan |
| 2019 | Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. | Ilya Zakirzyanov, Antnio Morgado, Alexey Ignatiev, Vladimir Ulyantsev, Joo Marques-Silva |
| 2019 | Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata. | Vladimir A. Zakharov |
| 2019 | Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. | Tomoyuki Yamakami |
| 2019 | Generalized Register Context-Free Grammars. | Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki |
| 2019 | Syntactic View of Sigma-Tau Generation of Permutations. | Wojciech Rytter, Wiktor Zuba |
| 2019 | Extensions of the Caucal Hierarchy? | Pawel Parys |
| 2019 | Palindromic Subsequences in Finite Words. | Clemens Mllner, Andrew Ryzhikov |
| 2019 | Automata over Infinite Sequences of Reals. | Klaus Meer, Ameen Naif |
| 2019 | On the Maximum Number of Distinct Palindromic Sub-arrays. | Kalpana Mahalingam, Palak Pandoh |
| 2019 | From Words to Graphs, and Back. | Vadim V. Lozin |
| 2019 | Learning Unions of k-Testable Languages. | Alexis Linard, Colin de la Higuera, Frits W. Vaandrager |
| 2019 | Observation and Interaction - Invited Paper. | Edward A. Lee |
| 2019 | Transformation of Petri Nets into Context-Dependent Fusion Grammars. | Hans-Jrg Kreowski, Sabine Kuske, Aaron Lye |
| 2019 | Efficient Representation and Counting of Antipower Factors in Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | State Complexity of Pseudocatenation. | Lila Kari, Timothy Ng |
| 2019 | Deterministic Biautomata and Subclasses of Deterministic Linear Languages. | Galina Jirskov, Ondrej Klma |
| 2019 | Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars. | Berthold Hoffmann, Mark Minas |