1. LATA 2007:
Tarragona,
Spain
Remco Loos, Szilárd Zsolt Fazekas, Carlos Martín-Vide (Eds.):
LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications.
Report 35/07 Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona 2007, ISBN 978-9810249489 
- Volker Diekert:
Equations: From Words to Graph Products.
1-6
- Nissim Francez, Michael Kaminski:
Pushdown automata with cancellation and commutation-augmented pregroups grammars.
7-26
- Helmut Jürgensen:
Synchronization.
27-48
- Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Branching Programs.
49-56
- Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo:
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
57-66
- Franz Baader, Jan Hladik, Rafael Peñaloza:
SI! Automata Can Show PSPACE Results for Description Logics.
67-78
- Pawel Baturo, Wojciech Rytter:
Occurrence and Lexicographic Properties of Standard Sturmian Words.
79-90
- Suna Bensch:
An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms.
91-102
- Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas:
Universality for Nondeterministic Logspace.
103-114
- Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg:
Fine and Wilf's Periodicity Result on Partial Words and Consequences.
115-126
- Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard:
Geometrical Languages.
127-138
- Olivier Bodini, Thomas Fernique, Eric Rémila:
A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane.
139-150
- Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
The Number of Convex Permutominoes.
151-162
- Benedikt Bollig, Dietrich Kuske:
Muller Message-Passing Automata and Logics.
163-174
- Bernd Borchert, Klaus Reinhardt:
Deterministically and Sudoku-Deterministically Recognizable Picture Languages.
175-186
- Henning Bordihn, György Vaszil:
On leftmost derivations in CD grammar systems.
187-198
- Julien Bourdaillet, Jean-Gabriel Ganascia:
Practical block sequence alignment with moves.
199-210
- Pietro di Lena, Luciano Margara:
Computational Complexity of Dynamical Systems: the case of Cellular Automata.
211-222
- Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea:
On the syllabification of words via go-through automata.
223-236
- Pál Dömösi:
Automata Networks without any Letichevsky Criteria.
237-248
- Jürgen Dassow, Henning Fernau:
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach.
249-260
- Hermann Gruber, Markus Holzer:
Computational Complexity of NFA Minimization for Finite and Unary Languages.
261-272
- Yo-Sub Han, Derick Wood:
Generalizations of One-Deterministic Regular Languages.
273-284
- Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol:
Weighted Degenerated Approximate Pattern Matching.
285-296
- Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Reductions of matrices associated with nowhere-zero flows.
297-306
- Ekaterina Komendantskaya:
First-order deduction in neural networks.
307-318
- Miklós Krész:
Nondeterministic soliton automata with a single external vertex.
319-330
- Martin Kutrib, Andreas Malcher:
Fast Reversible Language Recognition Using Cellular Automata.
331-342
- Martin Kutrib, Jens Reimann:
Succinct Description of Regular Languages by Weak Restarting Automata.
343-354
- Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu:
State Complexity of Basic Operations Combined with Reversal.
355-366
- Markus Lohrey, Benjamin Steinberg:
The submonoid and rational subset membership problems for graph groups.
367-378
- Andreas Maletti:
Compositions of Extended Top-down Tree Transducers.
379-390
- Pavel V. Martugin:
A series of slowly synchronizable automata with a zero state over a small alphabet.
391-402
- Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Grammars Regulated by Context Conditions.
403-412
- Hartmut Messerschmidt, Friedrich Otto:
On Determinism Versus Non-Determinism for Restarting Automata.
413-424
- Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata.
425-436
- Christos Nomikos, Panos Rondogiannis:
Locally Stratified Boolean Grammars.
437-448
- Zoltán L. Németh:
On the Regularity of Binoid Languages: A Comparative Approach.
449-460
- Kazuya Ogasawara, Satoshi Kobayashi:
Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation.
461-472
- Alexander Okhotin:
Unambiguous Boolean grammars.
473-484
- Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of Succinct Hierarchical State Machines.
485-496
- Mathieu Poudret, Jean-Paul Comet, Pascale Le Gall, Agnès Arnould, Philippe Meseure:
Topology-based Geometric Modelling for Biological Cellular Processes.
497-508
- Grigoriy Povarov:
Descriptive Complexity of the Hamming Neighborhood of a Regular Language.
509-520
- Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin:
Networks of Evolutionary Processors with Two Nodes Are Unpredictable.
521-528
- Victor L. Selivanov:
Classifying omega-regular partitions.
529-540
- Krystyna Stawikowska, Edward Ochmanski:
On Star-Free Trace Languages and their Lexicographic Representations.
541-552
- Ralf Stiebe:
Slender Siromoney Matrix Languages.
553-564
- Deian Tabakov, Moshe Y. Vardi:
Model Checking Buechi Specifications.
565-576
- Camilo Thorne:
Categorial Module Grammars of Bounded Size have Finite Bounded Density.
577-588
- Juntae Yoon, Gil-Young Song, Seonho Kim:
Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a Corpus.
589-599
Last update Fri May 25 08:25:01 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
