Developments in Language Theory C

41 papers

YearTitle / Authors
2009A Game-Theoretic Characterization of Boolean Grammars.
Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis
2009A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.
Marie-Pierre Béal, Dominique Perrin
2009A Weighted µ-Calculus on Words.
Ingmar Meinecke
2009An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words.
Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki
2009Asymptotic Cellular Complexity.
Bruno Durand, Victor Poupet
2009Balanced Words Having Simple Burrows-Wheeler Transform.
Antonio Restivo, Giovanna Rosone
2009Branching-Time Temporal Logics with Minimal Model Quantifiers.
Fabio Mogavero, Aniello Murano
2009Closures in Formal Languages and Kuratowski's Theorem.
Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit
2009Crucial Words for Abelian Powers.
Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev
2009Definability in the Infix Order on Words.
Oleg V. Kudinov, Victor L. Selivanov
2009Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings
Volker Diekert, Dirk Nowotka
2009Erasing in Petri Net Languages and Matrix Grammars.
Georg Zetzsche
2009Existence and Nonexistence of Descriptive Patterns.
Dominik D. Freydenberger, Daniel Reidenbach
2009Factorization Forests.
Mikolaj Bojanczyk
2009Left and Right Synchronous Relations.
Olivier Carton
2009Magic Numbers and Ternary Alphabet.
Galina Jirásková
2009Matrix Mortality and the Cerný-Pin Conjecture.
Jorge Almeida, Benjamin Steinberg
2009On Equations over Sets of Numbers and Their Limitations.
Tommi Lehtinen, Alexander Okhotin
2009On Negative Bases.
Christiane Frougny, Anna Chiara Lai
2009On Stateless Multihead Finite Automata and Multihead Pushdown Automata.
Pierluigi Frisco, Oscar H. Ibarra
2009On the Complexity of Deciding Avoidability of Sets of Partial Words.
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
2009On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations.
Aleksi Saarela
2009On the Decidability of the Equivalence for a Certain Class of Transducers.
Rodrigo de Souza
2009Post Correspondence Problem and Small Dimensional Matrices.
Tero Harju
2009Powers of Regular Languages.
Szilárd Zsolt Fazekas
2009Regular Languages Definable by Majority Quantifiers with Two Variables.
Christoph Behle, Andreas Krebs, Stephanie Reifferscheid
2009Rich and Periodic-Like Words.
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca
2009Simulations by Time-Bounded Counter Machines.
Holger Petersen
2009Size Complexity of Two-Way Finite Automata.
Christos A. Kapoutsis
2009Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.
Florin Manea, Victor Mitrana, José M. Sempere
2009Strongly Regular Grammars and Regular Approximation of Context-Free Languages.
Ömer Egecioglu
2009Subshifts, Languages and Logic.
Emmanuel Jeandel, Guillaume Theyssier
2009The Inclusion Problem of Context-Free Languages: Some Tractable Cases.
Alberto Bertoni, Christian Choffrut, Roberto Radicioni
2009The Pumping Lemma for Well-Nested Multiple Context-Free Languages.
Makoto Kanazawa
2009The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.
Daniel Kirsten
2009Tight Bounds on the Descriptional Complexity of Regular Expressions.
Hermann Gruber, Markus Holzer
2009Traces of Control-Flow Graphs.
Simone Campanoni, Stefano Crespi-Reghizzi
2009Two-Sided Bounds for the Growth Rates of Power-Free Languages.
Arseny M. Shur
2009Weighted Timed MSO Logics.
Karin Quaas
2009Weighted versus Probabilistic Logics.
Benedikt Bollig, Paul Gastin
2009Word Equations with One Unknown.
Markku Laine, Wojciech Plandowski