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