default search action
11th DLT 2007: Turku, Finland
- Tero Harju, Juhani Karhumäki, Arto Lepistö:
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Lecture Notes in Computer Science 4588, Springer 2007, ISBN 978-3-540-73207-5
Invited Talks
- Volker Diekert, Manfred Kufleitner:
On First-Order Fragments for Words and Mazurkiewicz Traces. 1-19 - Thomas A. Henzinger:
Quantitative Generalizations of Languages. 20-22 - Michal Kunc:
What Do We Know About Language Equations? 23-27 - Ming Li:
Information Distance and Applications. 28 - Jacques Sakarovitch:
Finite Automata and the Writing of Numbers. 29-30 - Kai Salomaa:
Descriptional Complexity of Nondeterministic Finite Automata. 31-35
Contributed Papers
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages. 36-47 - Marie-Pierre Béal, Fabio Burderi, Antonio Restivo:
Coding Partitions: Regularity, Maximality and Global Ambiguity. 48-59 - Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs:
Multi-letter Reversible and Quantum Finite Automata. 60-71 - Alberto Bertoni, Roberto Radicioni:
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids. 72-83 - Laurent Bienvenu, Mathieu Sablik:
The Dynamics of Cellular Automata in Shift-Invariant Topologies. 84-95 - Francine Blanchet-Sadri, N. C. Brownstein
, Justin Palumbo:
Two Element Unavoidable Sets of Partial Words. 96-107 - Henning Bordihn, Markus Holzer
Hairpin Finite Automata. 108-119 - Robert Brijder
Characterizing Reduction Graphs for Gene Assembly in Ciliates. 120-131 - Dario Carotenuto, Aniello Murano, Adriano Peron:
2-Visibly Pushdown Automata. 132-144 - Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression. 145-156 - Javier Esparza
An Extension of Newton's Method to omega -Continuous Semirings. 157-168 - Rusins Freivalds:
Non-constructive Methods for Finite Probabilistic Automata. 169-180 - Dominik D. Freydenberger, Daniel Reidenbach:
The Unambiguity of Segmented Morphisms. 181-192 - Anna E. Frid:
Commutation of Binary Factorial Languages. 193-204 - Hermann Gruber
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. 205-216 - Yo-Sub Han, Kai Salomaa:
State Complexity of Union and Intersection of Finite Languages. 217-228 - Johanna Högberg, Andreas Maletti, Jonathan May:
Bisimulation Minimisation for Weighted Tree Automata. 229-241 - Artur Jez:
Conjunctive Grammars Can Generate Non-regular Unary Languages. 242-253 - Jozef Jirásek
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. 254-265 - Sandrine Julia, Tran Vinh Duc:
Reduced Languages as omega -Generators. 266-277 - Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Avoiding Approximate Squares. 278-289 - Peter Leupold:
Duplication Roots. 290-299 - Remco Loos
Complexity Theory for Splicing Systems. 300-311 - Andreas Malcher
Descriptional Complexity of Bounded Context-Free Languages. 312-323 - Christian Mathissen:
Definable Transductions and Weighted Logics for Texts. 324-336 - Edward Ochmanski, Krystyna Stawikowska:
A Star Operation for Star-Free Trace Languages. 337-345 - Lutz Priese:
Finite Automata on Unranked and Unordered DAGs. 346-360 - Yuri Pritykin:
On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases. 361-370 - Gwénaël Richomme:
A Local Balance Property of Episturmian Words. 371-381 - Marinella Sciortino, Luca Q. Zamboni:
Suffix Automata and Standard Sturmian Words. 382-398 - Victor L. Selivanov:
Fine Hierarchy of Regular Aperiodic omega -Languages. 399-410 - Hellis Tamm:
On Transition Minimality of Bideterministic Automata. 411-421
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-04 20:31 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: