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