LATA C

41 papers

YearTitle / Authors
2011A Local Greibach Normal Form for Hyperedge Replacement Grammars.
Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll
2011A Simple and Efficient Universal Reversible Turing Machine.
Holger Bock Axelsen, Robert Glück
2011Abstract Numeration Systems.
Narad Rampersad
2011Automatic Learning of Subclasses of Pattern Languages.
John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
2011Automatic Structures and Groups.
Bakhadyr Khoussainov
2011Avalanche Structure in the Kadanoff Sand Pile Model.
Kévin Perrot, Eric Rémila
2011Bit-coded Regular Expression Parsing.
Lasse Nielsen, Fritz Henglein
2011Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars.
Robert Brijder, Hendrik Blockeel
2011Classification of String Languages via Tiling Recognizable Picture Languages.
Marcella Anselmo, Dora Giammarresi, Maria Madonia
2011Classifying Regular Languages via Cascade Products of Automata.
Marcus Gelderie
2011Decision Problems for Interval Markov Chains.
Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski
2011Descriptional Complexity of Unambiguous Nested Word Automata.
Alexander Okhotin, Kai Salomaa
2011Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access.
Daniel Reidenbach, Markus L. Schmid
2011Finitary Languages.
Krishnendu Chatterjee, Nathanaël Fijalkow
2011Finite Orbits of Language Operations.
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2011Globally Deterministic CD-Systems of Stateless R(1)-Automata.
Benedek Nagy, Friedrich Otto
2011Green's Relations and Their Use in Automata Theory.
Thomas Colcombet
2011Improved Alignment Based Algorithm for Multilingual Text Compression.
Ehud S. Conley, Shmuel Tomi Klein
2011Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings
Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide
2011Models for Quantitative Distributed Systems and Multi-Valued Logics.
Martin Huschenbett
2011Mutation Systems.
Dana Angluin, James Aspnes, Raonne Barbosa Vargas
2011Networks of Evolutionary Processors with Subregular Filters.
Jürgen Dassow, Florin Manea, Bianca Truthe
2011Normalization of Sequential Top-Down Tree-to-Word Transducers.
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2011On the Interval-Bound Problem for Weighted Timed Automata.
Karin Quaas
2011Partial Derivatives of an Extended Regular Expression.
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
2011Planarity of Knots, Register Automata and LogSpace Computability.
Alexei Lisitsa, Igor Potapov, Rafiq Saleh
2011Recognizing Shuffled Languages.
Martin Berglund, Henrik Björklund, Johanna Högberg
2011Restarting Automata with Auxiliary Symbols and Small Lookahead.
Natalie Schluter
2011Rule Formats for Distributivity.
Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers
2011Simplifying DPDA Using Supplementary Information.
Pavel Labath, Branislav Rovan
2011Singular Artin Monoids of Finite Coxeter Type Are Automatic.
Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas
2011Syntactic Complexity of Ultimately Periodic Sets of Integers.
Michel Rigo, Élise Vandomme
2011Tarski's Principle, Categorial Grammars and Learnability.
Jacek Marciniec
2011The Block Structure of Successor Morphisms.
Jana Hadravová
2011The Complexity of Request-Response Games.
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
2011The Parameterized Complexity of Chosen Problems for Finite Automata on Trees.
Agata Barecka, Witold Charatonik
2011Unary Pattern Avoidance in Partial Words Dense with Holes.
Francine Blanchet-Sadri, Kevin Black, Andrew Zemke
2011Undecidability of the State Complexity of Composed Regular Operations.
Arto Salomaa, Kai Salomaa, Sheng Yu
2011Unique Small Subgraphs Are Not Easier to Find.
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
2011Vector Addition System Reachability Problem: A Short Self-contained Proof.
Jérôme Leroux
2011Well-Quasi-Ordering Hereditarily Finite Sets.
Alberto Policriti, Alexandru I. Tomescu