Developments in Language Theory C

45 papers

YearTitle / Authors
2010A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages.
Dora Giammarresi
2010Algorithmic Properties of Millstream Systems.
Suna Bensch, Henrik Björklund, Frank Drewes
2010Around Dot Depth Two.
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah
2010Automata with Extremal Minimality Conditions.
Antonio Restivo, Roberto Vaglica
2010Complexity in Union-Free Regular Languages.
Galina Jirásková, Tomás Masopust
2010Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups.
Niko Haubold, Markus Lohrey, Christian Mathissen
2010Computing Blocker Sets for the Regular Post Embedding Problem.
Pierre Chambart, Philippe Schnoebelen
2010DNA Computing and Its Implications for Theoretical Computer Science.
Lila Kari
2010Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings
Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
2010Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm.
Alexander Okhotin
2010Graphs Capturing Alternations in Words.
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
2010Inclusion Problems for Patterns with a Bounded Number of Variables.
Joachim Bremer, Dominik D. Freydenberger
2010Input Products for Weighted Extended Top-Down Tree Transducers.
Andreas Maletti
2010Joint Topologies for Finite and Infinite Words.
Ludwig Staiger
2010Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices.
Manfred Droste, Heiko Vogler
2010Linking Algebraic Observational Equivalence and Bisimulation.
Mouhebeddine Berrima, Narjes Ben Rajeb
2010Minimization of Deterministic Bottom-Up Tree Transducers.
Sylvia Friese, Helmut Seidl, Sebastian Maneth
2010Numeration Systems: A Link between Number Theory and Formal Language Theory.
Michel Rigo
2010On Decision Problems for Simple and Parameterized Machines.
Oscar H. Ibarra
2010On Language Equations
Tommi Lehtinen, Alexander Okhotin
2010On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
Friedrich Otto, Martin Plátek, Frantisek Mráz
2010On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract).
Natalie Schluter
2010On Müller Context-Free Grammars.
Zoltán Ésik, Szabolcs Iván
2010On Restricted Context-Free Grammars.
Jürgen Dassow, Tomás Masopust
2010On Schützenberger Products of Semirings.
Ondrej Klíma, Libor Polák
2010On a Conjecture by Carpi and D'Alessandro.
Mikhail V. Berlinkov
2010On a Powerful Class of Non-universal P Systems with Active Membranes.
Antonio E. Porreca, Alberto Leporati, Claudio Zandron
2010On the Average Number of States of Partial Derivative Automata.
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2010On the Existence of Minimal
Arseny M. Shur
2010On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.
Arturo Carpi, Flavio D'Alessandro
2010On the Iterated Hairpin Completion.
Steffen Kopecki
2010On the Periodicity of Morphic Words.
Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo
2010Periodicity in Tilings.
Emmanuel Jeandel, Pascal Vanier
2010Pseudo-power Avoidance.
Ehsan Chiniforooshan, Lila Kari, Zhi Xu
2010Rankers over Infinite Words - (Extended Abstract).
Luc Dartois, Manfred Kufleitner, Alexander Lauser
2010Reaction Systems: A Model of Computation Inspired by Biochemistry.
Andrzej Ehrenfeucht, Grzegorz Rozenberg
2010Regular Hedge Language Factorization Revisited.
Mircea Marin, Temur Kutsia
2010Restricted Ambiguity of Erasing Morphisms.
Daniel Reidenbach, Johannes C. Schneider
2010Schema for Parallel Insertion and Deletion.
Lila Kari, Shinnosuke Seki
2010State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages.
Elena V. Pribavkina, Emanuele Rodaro
2010The Averaging Trick and the Cerný Conjecture.
Benjamin Steinberg
2010The Complexity of Regular(-Like) Expressions.
Markus Holzer, Martin Kutrib
2010Two-Way Unary Automata versus Logarithmic Space.
Viliam Geffert, Giovanni Pighizzini
2010Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.
Henning Bordihn, Martin Kutrib, Andreas Malcher
2010Using Light to Implement Parallel Boolean Algebra.
Tom Head