Developments in Language Theory C

44 papers

YearTitle / Authors
2012A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
2012Acceptance Conditions for ω-Languages.
Alberto Dennunzio, Enrico Formenti, Julien Provillard
2012Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata.
Christos A. Kapoutsis, Nans Lefebvre
2012Biautomata for k-Piecewise Testable Languages.
Ondrej Klíma, Libor Polák
2012Cellular Automata, the Collatz Conjecture and Powers of 3/2.
Jarkko Kari
2012Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract).
Jeroen Ketema, Jakob Grue Simonsen
2012Checking Determinism of Regular Expressions with Counting.
Haiming Chen, Ping Lu
2012Computing the Edit-Distance between a Regular Language and a Context-Free Language.
Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
2012Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
2012Decidability of Geometricity of Regular Languages.
Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy
2012Dense Completeness.
Andreas Krebs, Klaus-Jörn Lange
2012Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ.
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
2012Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings
Hsu-Chun Yen, Oscar H. Ibarra
2012Fine and Wilf's Theorem for k-Abelian Periods.
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2012From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract).
Markus Holzer, Sebastian Jakobi
2012Generalized Derivations with Synchronized Context-Free Grammars.
Markus Holzer, Sebastian Jakobi, Ian McQuillan
2012Geometry and Dynamics of the Besicovitch and Weyl Spaces.
Ville Salo, Ilkka Törmä
2012Hairpin Completion with Bounded Stem-Loop.
Szilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji
2012Homomorphisms Preserving Deterministic Context-Free Languages.
Tommi Lehtinen, Alexander Okhotin
2012Inside the Class of REGEX Languages.
Markus L. Schmid
2012Learning Rational Functions.
Adrien Boiret, Aurélien Lemay, Joachim Niehren
2012Morphic Primitivity and Alphabet Reductions.
Hossein Nevisi, Daniel Reidenbach
2012Non-erasing Variants of the Chomsky-Schützenberger Theorem.
Alexander Okhotin
2012On Centralized PC Grammar Systems with Context-Sensitive Components.
Friedrich Otto
2012On Context-Free Languages of Scattered Words.
Zoltán Ésik, Satoshi Okawa
2012On State Complexity of Finite Word and Tree Languages.
Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu
2012On a Hierarchy of Languages with Catenation and Shuffle.
Nils Erik Flick, Manfred Kudlek
2012P and dP Automata: Unconventional versus Classical Automata.
Erzsébet Csuhaj-Varjú
2012Pseudoperiodic Words.
Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
2012Quotient Complexities of Atoms of Regular Languages.
Janusz A. Brzozowski, Hellis Tamm
2012Recovering Strings in Oracles: Quantum and Classic.
Kazuo Iwama
2012Regular and Context-Free Pattern Languages over Small Alphabets.
Daniel Reidenbach, Markus L. Schmid
2012Semigroups with a Context-Free Word Problem.
Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas
2012Squares in Binary Partial Words.
Francine Blanchet-Sadri, Yang Jiao, John M. Machacek
2012States and Heads Do Count for Unary Multi-head Finite Automata.
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2012The Avoidability of Cubes under Permutations.
Florin Manea, Mike Müller, Dirk Nowotka
2012The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012.
Andrew Szilard
2012The State Complexity of Star-Complement-Star.
Galina Jirásková, Jeffrey O. Shallit
2012Two-Dimensional Sgraffito Automata.
Daniel Prusa, Frantisek Mráz
2012Two-Way Transducers with a Two-Way Output Tape.
Olivier Carton
2012Unambiguous Constrained Automata.
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012Unary Coded NP-Complete Languages in ASPACE (log log n).
Viliam Geffert, Dana Pardubská
2012Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars.
Matthias Büchse, Andreas Maletti, Heiko Vogler
2012Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness.
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot