LATA C

51 papers

YearTitle / Authors
2007A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane.
Olivier Bodini, Thomas Fernique, Eric Rémila
2007A series of slowly synchronizable automata with a zero state over a small alphabet.
Pavel V. Martugin
2007An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms.
Suna Bensch
2007Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo
2007Automata Networks without any Letichevsky Criteria.
Pál Dömösi
2007Categorial Module Grammars of Bounded Size have Finite Bounded Density.
Camilo Thorne
2007Classical Simulation Complexity of Quantum Branching Programs.
Farid M. Ablayev, Aida Gainutdinova
2007Classifying omega-regular partitions.
Victor L. Selivanov
2007Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach.
Jürgen Dassow, Henning Fernau
2007Compositions of Extended Top-down Tree Transducers.
Andreas Maletti
2007Computational Complexity of Dynamical Systems: the case of Cellular Automata.
Pietro di Lena, Luciano Margara
2007Computational Complexity of NFA Minimization for Finite and Unary Languages.
Hermann Gruber, Markus Holzer
2007Descriptional Complexity of Grammars Regulated by Context Conditions.
Tomás Masopust, Alexander Meduna
2007Descriptive Complexity of the Hamming Neighborhood of a Regular Language.
Grigoriy Povarov
2007Deterministically and Sudoku-Deterministically Recognizable Picture Languages.
Bernd Borchert, Klaus Reinhardt
2007Equations: From Words to Graph Products.
Volker Diekert
2007Fast Reversible Language Recognition Using Cellular Automata.
Martin Kutrib, Andreas Malcher
2007Fine and Wilf's Periodicity Result on Partial Words and Consequences.
Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
2007First-order deduction in neural networks.
Ekaterina Komendantskaya
2007Free Word-Order and Restarting Automata.
Frantisek Mráz, Friedrich Otto, Martin Plátek
2007Generalizations of One-Deterministic Regular Languages.
Yo-Sub Han, Derick Wood
2007Geometrical Languages.
Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard
2007LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications.
Remco Loos, Szilárd Zsolt Fazekas, Carlos Martín-Vide
2007Locally Stratified Boolean Grammars.
Christos Nomikos, Panos Rondogiannis
2007Model Checking Buechi Specifications.
Deian Tabakov, Moshe Y. Vardi
2007Muller Message-Passing Automata and Logics.
Benedikt Bollig, Dietrich Kuske
2007Networks of Evolutionary Processors with Two Nodes Are Unpredictable.
Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin
2007Nondeterministic soliton automata with a single external vertex.
Miklós Krész
2007Occurrence and Lexicographic Properties of Standard Sturmian Words.
Pawel Baturo, Wojciech Rytter
2007On Determinism Versus Non-Determinism for Restarting Automata.
Hartmut Messerschmidt, Friedrich Otto
2007On Star-Free Trace Languages and their Lexicographic Representations.
Krystyna Stawikowska, Edward Ochmanski
2007On leftmost derivations in CD grammar systems.
Henning Bordihn, György Vaszil
2007On the Regularity of Binoid Languages: A Comparative Approach.
Zoltán L. Németh
2007On the syllabification of words via go-through automata.
Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea
2007Practical block sequence alignment with moves.
Julien Bourdaillet, Jean-Gabriel Ganascia
2007Pushdown automata with cancellation and commutation-augmented pregroups grammars.
Nissim Francez, Michael Kaminski
2007Reductions of matrices associated with nowhere-zero flows.
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2007Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a Corpus.
Juntae Yoon, Gil-Young Song, Seonho Kim
2007SI! Automata Can Show PSPACE Results for Description Logics.
Franz Baader, Jan Hladik, Rafael Peñaloza
2007Slender Siromoney Matrix Languages.
Ralf Stiebe
2007State Complexity of Basic Operations Combined with Reversal.
Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu
2007Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation.
Kazuya Ogasawara, Satoshi Kobayashi
2007Succinct Description of Regular Languages by Weak Restarting Automata.
Martin Kutrib, Jens Reimann
2007Synchronization.
Helmut Jürgensen
2007The Number of Convex Permutominoes.
Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini
2007The submonoid and rational subset membership problems for graph groups.
Markus Lohrey, Benjamin Steinberg
2007Topology-based Geometric Modelling for Biological Cellular Processes.
Mathieu Poudret, Jean-Paul Comet, Pascale Le Gall, Agnès Arnould, Philippe Meseure
2007Unambiguous Boolean grammars.
Alexander Okhotin
2007Universality for Nondeterministic Logspace.
Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas
2007Verification of Succinct Hierarchical State Machines.
Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato
2007Weighted Degenerated Approximate Pattern Matching.
Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol