default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. LATA 2009: Tarragona, Spain
- Adrian-Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide:
Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings. Lecture Notes in Computer Science 5457, Springer 2009, ISBN 978-3-642-00981-5
Invited Talks
- Frank J. Balbach, Thomas Zeugmann:
Recent Developments in Algorithmic Teaching. 1-18 - Bruno Courcelle:
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. 19-22 - Markus Holzer
, Martin Kutrib:
Descriptional and Computational Complexity of Finite Automata. 23-42 - Sanjay Jain:
Hypothesis Spaces for Learning. 43-58 - Kai Salomaa:
State Complexity of Nested Word Automata. 59-70
Regular Papers
- Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations. 71-82 - Sergey A. Afonin, Denis Golomazov:
Minimal Union-Free Decompositions of Regular Languages. 83-92 - Yohji Akama:
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory. 93-104 - Franz Baader, Andreas Bauer, Alwen Tiu:
Matching Trace Patterns with Regular Policies. 105-116 - Raphaël Bailly, François Denis:
Absolute Convergence of Rational Series Is Semi-decidable. 117-128 - Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]. 129-140 - Tobias Berg, Harald Hempel:
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. 141-151 - Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet:
Refinement and Consistency of Timed Modal Specifications. 152-163 - Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice. 164-175 - Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas:
How Many Holes Can an Unbordered Partial Word Contain?. 176-187 - Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett:
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. 188-199 - Bernard Boigelot, Jean-François Degbomont:
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization. 200-211 - Beate Bollig:
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. 212-223 - Paola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri:
Picture Languages Generated by Assembling Tiles. 224-235 - Henning Bordihn, Markus Holzer, Martin Kutrib:
Undecidability of Operation Problems for T0L Languages and Subclasses. 236-246 - Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision Problems for Convex Languages. 247-258 - Michelangelo Bucci, Alessandro De Luca:
On a Family of Morphic Images of Arnoux-Rauzy Words. 259-266 - Matthias Büchse, Torsten Stüber:
Monadic Datalog Tree Transducers. 267-278 - Benjamin Carle, Paliath Narendran:
On Extended Regular Expressions. 279-289 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Multi-tilde Operators and Their Glushkov Automata. 290-301 - Gianpiero Cattaneo, Alberto Dennunzio, Enrico Formenti, Julien Provillard:
Non-uniform Cellular Automata. 302-313 - Adam Clarridge, Kai Salomaa:
A Cryptosystem Based on the Composition of Reversible Cellular Automata. 314-325 - Jürgen Dassow, Sherzod Turaev:
Grammars Controlled by Special Petri Nets. 326-337 - Kimmo Fredriksson, Szymon Grabowski:
Nested Counters in Bit-Parallel String Matching. 338-349 - Olivier Gauwin, Joachim Niehren, Sophie Tison:
Bounded Delay and Concurrency for Earliest Query Answering. 350-361 - Nina Gierasimczuk:
Learning by Erasing in Dynamic Epistemic Logic. 362-373 - Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The Fault Tolerance of NP-Hard Problems. 374-385 - Isabelle Gnaedig:
Termination of Priority Rewriting. 386-397 - Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. 398-409 - Kees Hemerik:
Towards a Taxonomy for ECFG and RRPG Parsing. 410-421 - Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting Parameterized Border Arrays for a Binary Alphabet. 422-433 - Masami Ito, Peter Leupold, Victor Mitrana:
Bounded Hairpin Completion. 434-445 - Florent Jacquemard, Francis Klay, Camille Vacher:
Rigid Tree Automata. 446-457 - Galina Jirásková, Giovanni Pighizzini:
Converting Self-verifying Automata into Deterministic Automata. 458-468 - Anna Kasprzik:
Two Equivalent Regularizations for Tree Adjoining Grammars. 469-480 - Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching. 481-492 - Nutan Limaye, Meena Mahajan:
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. 493-504 - Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
Automata on Gauss Words. 505-517 - Jiamou Liu, Mia Minnes:
Analysing Complexity in Classes of Unary Automatic Structures. 518-529 - Jordi Llull-Chavarría, Óscar Valero:
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words. 530-541 - Markéta Lopatková, Tomás Holan:
Segmentation Charts for Czech - Relations among Segments in Complex Sentences. 542-553 - Tomás Masopust:
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. 554-565 - Ryuichi Matoba, Makoto Nakamura, Satoshi Tojo:
Efficiency of the Symmetry Bias in Grammar Acquisition. 566-577 - Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara:
A Series of Run-Rich Strings. 578-587 - Victor Mitrana, Bianca Truthe:
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes. 588-600 - Neil Moore:
The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates. 601-613 - Makoto Nakamura, Takashi Hashimoto, Satoshi Tojo:
Prediction of Creole Emergence in Spatial Language Dynamics. 614-625 - Cyril Nicaud:
On the Average Size of Glushkov's Automata. 626-637 - Nicolas Ollinger:
Tiling the Plane with a Fixed Number of Polyominoes. 638-647 - Kaoru Onodera:
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality. 648-659 - Dana Pardubská, Martin Plátek, Friedrich Otto:
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. 660-671 - Elena V. Pribavkina, Emanuele Rodaro:
Finitely Generated Synchronizing Automata. 672-683 - Adam Roman:
Genetic Algorithm for Synchronization. 684-695 - Paul V. Salimov:
Constructing Infinite Words of Intermediate Arithmetical Complexity. 696-701 - Céline Scornavacca, Vincent Berry, Vincent Ranwez:
From Gene Trees to Species Trees through a Supertree Approach. 702-714 - Lutz Straßburger:
A Kleene Theorem for Forest Languages. 715-727 - P. Vijay Suman, Paritosh K. Pandya:
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions. 728-739 - Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. 740-751
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 2025-11-11 23:00 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:
