default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. LATA 2008: Tarragona, Spain
- Carlos Martín-Vide, Friedrich Otto, Henning Fernau:
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Lecture Notes in Computer Science 5196, Springer 2008, ISBN 978-3-540-88281-7
Invited Papers
- Mikolaj Bojanczyk:
Tree-Walking Automata. 1-2 - Michael Domaratzki
:
Formal Language Tools for Template-Guided DNA Recombination. 3-5 - Benjamin Steinberg:
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg. 6-10 - Mikhail V. Volkov:
Synchronizing Automata and the Cerny Conjecture. 11-27
Contributed Papers
- Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
About Universal Hybrid Networks of Evolutionary Processors of Small Size. 28-39 - Jan-Henrik Altenbernd:
On Bifix Systems and Generalizations. 40-51 - Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite Automata, Palindromes, Powers, and Patterns. 52-63 - Pablo Arrighi, Vincent Nesme, Reinhard F. Werner:
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations. 64-75 - Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. 76-87 - Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. 88-100 - Florent Becker:
Transformations and Preservation of Self-assembly Dynamics through Homotheties. 101-112 - Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
Deterministic Input-Reversal and Input-Revolving Finite Automata. 113-124 - Henning Bordihn, Markus Holzer:
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. 125-136 - Robert Brijder, Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates. 137-148 - Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations for Cancellative Semigroups. 149-159 - Silvio Capobianco:
Induced Subshifts and Cellular Automata. 160-171 - Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Cyclic Automata. 172-183 - Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. 184-195 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual Definition of Languages by Regular Sets. 196-208 - Jürgen Dassow, Sherzod Turaev:
k-Petri Net Controlled Grammars. 209-220 - Pawel Gawrychowski, Andrzej Kisielewicz:
2-Synchronizing Words. 221-231 - Mathieu Giraud:
Not So Many Runs in Strings. 232-239 - Hong Phuong Le, Nguyên Thi Minh Huyên, Azim Roussanaly, Hô Tuòng Vinh:
A Hybrid Approach to Word Segmentation of Vietnamese Texts. 240-249 - Ozan Kahramanogullari:
On Linear Logic Planning and Concurrency. 250-262 - Laura Kallmeyer, Yannick Parmentier:
On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG). 263-274 - Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau:
Anti-pattern Matching Modulo. 275-286 - Sergey Kitaev, Toufik Mansour, Patrice Séébold:
Counting Ordered Patterns in Words Generated by Morphisms. 287-298 - Ondrej Klíma, Libor Polák:
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. 299-310 - Barbara Klunder:
Characterization of Star-Connected Languages Using Finite Automata. 311-320 - Martin Korp, Aart Middeldorp:
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. 321-332 - Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Further Results on Insertion-Deletion Systems with One-Sided Contexts. 333-344 - Peter Leupold:
On Regularity-Preservation by String-Rewriting Systems. 345-356 - Andreas Maletti:
Minimizing Deterministic Weighted Tree Automata. 357-372 - Mark Mercer:
Lower Bounds for Generalized Quantum Finite Automata. 373-384 - Malgorzata Moczurad, Wlodzimierz Moczurad:
How Many Figure Sets Are Codes?. 385-396 - Etsuro Moriya, Friedrich Otto:
On Alternating Phrase-Structure Grammars. 397-408 - Friedrich Otto, Martin Plátek:
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. 409-420 - Alexander Perekrestenko:
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard. 421-432 - Holger Petersen:
Sorting and Element Distinctness on One-Way Turing Machines. 433-439 - Svetlana Puzynina:
On Periodicity of Generalized Two-Dimensional Words. 440-451 - Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the Analysis of "Simple" 2D Stochastic Cellular Automata. 452-463 - Elaine Render, Mark Kambites:
Polycyclic and Bicyclic Valence Automata. 464-475 - Arto Salomaa, Kai Salomaa, Sheng Yu:
Length Codes, Products of Languages and Primality. 476-486 - Ryo Yoshinaka:
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. 487-498
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 2026-01-29 23:11 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:
