| 2017 | A Calculus of Cyber-Physical Systems. Ruggero Lanotte, Massimo Merro |
| 2017 | A Derivational Model of Discontinuous Parsing. Mark-Jan Nederhof, Anssi Yli-Jyrä |
| 2017 | A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus. Thomas Troels Hildebrandt, Christian Johansen, Håkon Normann |
| 2017 | An Automata View to Goal-Directed Methods. Lisa Hutschenreiter, Rafael Peñaloza |
| 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 |
| 2017 | Color War: Cellular Automata with Majority-Rule. Bernd Gärtner, Ahad N. Zehmakan |
| 2017 | Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. Janusz A. Brzozowski, Corwin Sinnamon |
| 2017 | Consensus String Problem for Multiple Regular Languages. Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa |
| 2017 | Cut Languages in Rational Bases. Jirí Síma, Petr Savický |
| 2017 | Derivatives and Finite Automata of Expressions in Star Normal Form. Haiming Chen, Ping Lu |
| 2017 | Detecting Useless Transitions in Pushdown Automata. Dick Grune, Wan J. Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers |
| 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 | Finding DFAs with Maximal Shortest Synchronizing Word Length. Henk Don, Hans Zantema |
| 2017 | Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. Chunmiao Li, Xiaojuan Cai |
| 2017 | Integrated Encryption in Dynamic Arithmetic Compression. Shmuel T. Klein, Dana Shapira |
| 2017 | Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings Frank Drewes, Carlos Martín-Vide, Bianca Truthe |
| 2017 | Linear Parsing Expression Grammars. Nariyoshi Chida, Kimio Kuramitsu |
| 2017 | Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data. Georg Gottlob, Christoph Koch, Andreas Pieris |
| 2017 | Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited. Hellis Tamm, Brink van der Merwe |
| 2017 | Merging Relations: A Way to Compact Petri Nets' Behaviors Uniformly. Giovanni Casu, G. Michele Pinna |
| 2017 | Minimization of Finite State Automata Through Partition Aggregation. Johanna Björklund, Loek Cleophas |
| 2017 | Most General Property-Preserving Updates. Davide Bresolin, Ivan Lanese |
| 2017 | N-Memory Automata over the Alphabet N. Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas |
| 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 Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer |
| 2017 | On the Computational Power of Affine Automata. Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz |
| 2017 | Over Which Monoids is the Transducer Determinization Procedure Applicable? Stefan Gerdjikov, Stoyan Mihov |
| 2017 | Partitioning Graphs into Induced Subgraphs. Dusan Knop |
| 2017 | Reachability Analysis of Pushdown Systems with an Upper Stack. Adrien Pommellet, Marcio Diaz, Tayssir Touili |
| 2017 | Space Complexity of Reachability Testing in Labelled Graphs. Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil |
| 2017 | The Strong, Weak, and Very Weak Finite Context and Kernel Properties. Makoto Kanazawa, Ryo Yoshinaka |
| 2017 | The Weight in Enumeration. Johannes Schmidt |
| 2017 | Two-Dimensional Palindromes and Their Properties. Manasi S. Kulkarni, Kalpana Mahalingam |