| 2007 | Pushdown automata with cancellation and commutation-augmented pregroups grammars. | Nissim Francez, Michael Kaminski |
| 2007 | Automata Networks without any Letichevsky Criteria. | Pl Dmsi |
| 2007 | On the syllabification of words via go-through automata. | Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea |
| 2007 | Equations: From Words to Graph Products. | Volker Diekert |
| 2007 | Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. | Jrgen Dassow, Henning Fernau |
| 2007 | Universality for Nondeterministic Logspace. | Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas |
| 2007 | Practical block sequence alignment with moves. | Julien Bourdaillet, Jean-Gabriel Ganascia |
| 2007 | On leftmost derivations in CD grammar systems. | Henning Bordihn, Gyrgy Vaszil |
| 2007 | Deterministically and Sudoku-Deterministically Recognizable Picture Languages. | Bernd Borchert, Klaus Reinhardt |
| 2007 | Muller Message-Passing Automata and Logics. | Benedikt Bollig, Dietrich Kuske |
| 2007 | The Number of Convex Permutominoes. | Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini |
| 2007 | A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane. | Olivier Bodini, Thomas Fernique, Eric Rmila |
| 2007 | Geometrical Languages. | Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard |
| 2007 | Fine and Wilf's Periodicity Result on Partial Words and Consequences. | Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg |
| 2007 | An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms. | Suna Bensch |
| 2007 | Occurrence and Lexicographic Properties of Standard Sturmian Words. | Pawel Baturo, Wojciech Rytter |
| 2007 | SI! Automata Can Show PSPACE Results for Description Logics. | Franz Baader, Jan Hladik, Rafael Pealoza |
| 2007 | Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. | Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo |
| 2007 | Networks of Evolutionary Processors with Two Nodes Are Unpredictable. | Artiom Alhazov, Carlos Martn-Vide, Yurii Rogozhin |
| 2007 | Classical Simulation Complexity of Quantum Branching Programs. | Farid M. Ablayev, Aida Gainutdinova |