| 2017 | Integrated Encryption in Dynamic Arithmetic Compression. | Shmuel T. Klein, Dana Shapira |
| 2017 | The Strong, Weak, and Very Weak Finite Context and Kernel Properties. | Makoto Kanazawa, Ryo Yoshinaka |
| 2017 | Efficient Learning of Tier-Based Strictly k-Local Languages. | Adam Jardine, Kevin McMullin |
| 2017 | Efficient Pattern Matching in Elastic-Degenerate Texts. | Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis |
| 2017 | An Automata View to Goal-Directed Methods. | Lisa Hutschenreiter, Rafael Pealoza |
| 2017 | On the Computational Power of Affine Automata. | Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz |
| 2017 | A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus. | Thomas Troels Hildebrandt, Christian Johansen, Hkon Normann |
| 2017 | Consensus String Problem for Multiple Regular Languages. | Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa |
| 2017 | Detecting Useless Transitions in Pushdown Automata. | Dick Grune, Wan J. Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers |
| 2017 | Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data. | Georg Gottlob, Christoph Koch, Andreas Pieris |
| 2017 | Over Which Monoids is the Transducer Determinization Procedure Applicable? | Stefan Gerdjikov, Stoyan Mihov |
| 2017 | Color War: Cellular Automata with Majority-Rule. | Bernd Grtner, Ahad N. Zehmakan |
| 2017 | Finding DFAs with Maximal Shortest Synchronizing Word Length. | Henk Don, Hans Zantema |
| 2017 | On Finite-Index Indexed Grammars and Their Restrictions. | Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan |
| 2017 | On the Complexity of Hard Enumeration Problems. | Nadia Creignou, Markus Krll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer |
| 2017 | Linear Parsing Expression Grammars. | Nariyoshi Chida, Kimio Kuramitsu |
| 2017 | Derivatives and Finite Automata of Expressions in Star Normal Form. | Haiming Chen, Ping Lu |
| 2017 | Merging Relations: A Way to Compact Petri Nets' Behaviors Uniformly. | Giovanni Casu, G. Michele Pinna |
| 2017 | Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. | Janusz A. Brzozowski, Corwin Sinnamon |
| 2017 | N-Memory Automata over the Alphabet N. | Benedikt Brtsch, Patrick Landwehr, Wolfgang Thomas |
| 2017 | Most General Property-Preserving Updates. | Davide Bresolin, Ivan Lanese |
| 2017 | Minimization of Finite State Automata Through Partition Aggregation. | Johanna Bjrklund, Loek Cleophas |
| 2017 | Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in | Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis |
| 2016 | Automata for Ontologies. | Frank Wolter |
| 2016 | The Complexity of Induced Tree Reconfiguration Problems. | Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura |