default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th DLT 2010: London, ON, Canada
- Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu:
Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. Lecture Notes in Computer Science 6224, Springer 2010, ISBN 978-3-642-14454-7
Invited Talks
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems: A Model of Computation Inspired by Biochemistry. 1-3 - Dora Giammarresi:
A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages. 4-15 - Markus Holzer
, Martin Kutrib:
The Complexity of Regular(-Like) Expressions. 16-30 - Oscar H. Ibarra:
On Decision Problems for Simple and Parameterized Machines. 31 - Lila Kari:
DNA Computing and Its Implications for Theoretical Computer Science. 32 - Michel Rigo:
Numeration Systems: A Link between Number Theory and Formal Language Theory. 33-53
Regular Papers
- Suna Bensch, Henrik Björklund, Frank Drewes:
Algorithmic Properties of Millstream Systems. 54-65 - Mikhail V. Berlinkov:
On a Conjecture by Carpi and D'Alessandro. 66-75 - Mouhebeddine Berrima, Narjes Ben Rajeb:
Linking Algebraic Observational Equivalence and Bisimulation. 76-87 - Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. 88-99 - Joachim Bremer, Dominik D. Freydenberger:
Inclusion Problems for Patterns with a Bounded Number of Variables. 100-111 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Number of States of Partial Derivative Automata. 112-123 - Arturo Carpi, Flavio D'Alessandro:
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths. 124-135 - Pierre Chambart, Philippe Schnoebelen:
Computing Blocker Sets for the Regular Post Embedding Problem. 136-147 - Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words - (Extended Abstract). 148-159 - Manfred Droste, Heiko Vogler:
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. 160-172 - Zoltán Ésik, Szabolcs Iván:
On Müller Context-Free Grammars. 173-184 - Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Minimization of Deterministic Bottom-Up Tree Transducers. 185-196 - Viliam Geffert, Giovanni Pighizzini:
Two-Way Unary Automata versus Logarithmic Space. 197-208 - Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. 209-217 - Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. 218-230 - Tom Head:
Using Light to Implement Parallel Boolean Algebra. 231-242 - Emmanuel Jeandel, Pascal Vanier:
Periodicity in Tilings. 243-254 - Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. 255-266 - Lila Kari, Shinnosuke Seki:
Schema for Parallel Insertion and Deletion. 267-278 - Ondrej Klíma, Libor Polák:
On Schützenberger Products of Semirings. 279-290 - Tommi Lehtinen, Alexander Okhotin:
On Language Equations XXK = XXL and XM = N over a Unary Alphabet. 291-302 - Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah:
Around Dot Depth Two. 303-315 - Andreas Maletti:
Input Products for Weighted Extended Top-Down Tree Transducers. 316-327 - Mircea Marin, Temur Kutsia:
Regular Hedge Language Factorization Revisited. 328-339 - Alexander Okhotin:
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. 340-351 - Friedrich Otto, Martin Plátek, Frantisek Mráz:
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. 352-363 - Antonio E. Porreca, Alberto Leporati, Claudio Zandron:
On a Powerful Class of Non-universal P Systems with Active Membranes. 364-375 - Elena V. Pribavkina, Emanuele Rodaro:
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages. 376-386 - Daniel Reidenbach, Johannes C. Schneider:
Restricted Ambiguity of Erasing Morphisms. 387-398 - Antonio Restivo, Roberto Vaglica:
Automata with Extremal Minimality Conditions. 399-410 - Arseny M. Shur:
On the Existence of Minimal beta-Powers. 411-422 - Benjamin Steinberg:
The Averaging Trick and the Cerný Conjecture. 423-431
Short Papers
- Ehsan Chiniforooshan, Lila Kari, Zhi Xu:
Pseudo-power Avoidance. 432-433 - Jürgen Dassow, Tomás Masopust:
On Restricted Context-Free Grammars. 434-435 - Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Graphs Capturing Alternations in Words. 436-437 - Steffen Kopecki:
On the Iterated Hairpin Completion. 438-439 - Natalie Schluter:
On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract). 440-441 - Ludwig Staiger:
Joint Topologies for Finite and Infinite Words. 442-443
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
