LATA C

64 papers

YearTitle / Authors
2009A Cryptosystem Based on the Composition of Reversible Cellular Automata.
Adam Clarridge, Kai Salomaa
2009A Kleene Theorem for Forest Languages.
Lutz Straßburger
2009A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin
2009A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions.
Tomás Masopust
2009A Series of Run-Rich Strings.
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
2009Absolute Convergence of Rational Series Is Semi-decidable.
Raphaël Bailly, François Denis
2009An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.
Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
2009An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words.
Jordi Llull-Chavarría, Óscar Valero
2009Analysing Complexity in Classes of Unary Automatic Structures.
Jiamou Liu, Mia Minnes
2009Automata on Gauss Words.
Alexei Lisitsa, Igor Potapov, Rafiq Saleh
2009Bounded Delay and Concurrency for Earliest Query Answering.
Olivier Gauwin, Joachim Niehren, Sophie Tison
2009Bounded Hairpin Completion.
Masami Ito, Peter Leupold, Victor Mitrana
2009Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory.
Yohji Akama
2009Constructing Infinite Words of Intermediate Arithmetical Complexity.
Paul V. Salimov
2009Converting Self-verifying Automata into Deterministic Automata.
Galina Jirásková, Giovanni Pighizzini
2009Counting Parameterized Border Arrays for a Binary Alphabet.
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009Decision Problems for Convex Languages.
Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu
2009Descriptional and Computational Complexity of Finite Automata.
Markus Holzer, Martin Kutrib
2009Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions.
P. Vijay Suman, Paritosh K. Pandya
2009Efficiency of the Symmetry Bias in Grammar Acquisition.
Ryuichi Matoba, Makoto Nakamura, Satoshi Tojo
2009Finitely Generated Synchronizing Automata.
Elena V. Pribavkina, Emanuele Rodaro
2009From Gene Trees to Species Trees through a Supertree Approach.
Céline Scornavacca, Vincent Berry, Vincent Ranwez
2009Genetic Algorithm for Synchronization.
Adam Roman
2009Grammars Controlled by Special Petri Nets.
Jürgen Dassow, Sherzod Turaev
2009How Many Holes Can an Unbordered Partial Word Contain?.
Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas
2009Hypothesis Spaces for Learning.
Sanjay Jain
2009Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Adrian-Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide
2009Larger Lower Bounds on the OBDD Complexity of Integer Multiplication.
Beate Bollig
2009Learning by Erasing in Dynamic Epistemic Logic.
Nina Gierasimczuk
2009Matching Trace Patterns with Regular Policies.
Franz Baader, Andreas Bauer, Alwen Tiu
2009Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.
Nutan Limaye, Meena Mahajan
2009Minimal Union-Free Decompositions of Regular Languages.
Sergey A. Afonin, Denis Golomazov
2009Monadic Datalog Tree Transducers.
Matthias Büchse, Torsten Stüber
2009Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications.
Bruno Courcelle
2009Multi-tilde Operators and Their Glushkov Automata.
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
2009Nested Counters in Bit-Parallel String Matching.
Kimmo Fredriksson, Szymon Grabowski
2009New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality.
Kaoru Onodera
2009Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].
Christoph Behle, Andreas Krebs, Stephanie Reifferscheid
2009Non-uniform Cellular Automata.
Gianpiero Cattaneo, Alberto Dennunzio, Enrico Formenti, Julien Provillard
2009Nondeterministic Instance Complexity and Proof Systems with Advice.
Olaf Beyersdorff, Johannes Köbler, Sebastian Müller
2009On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes.
Victor Mitrana, Bianca Truthe
2009On Extended Regular Expressions.
Benjamin Carle, Paliath Narendran
2009On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
Dana Pardubská, Martin Plátek, Friedrich Otto
2009On a Family of Morphic Images of Arnoux-Rauzy Words.
Michelangelo Bucci, Alessandro De Luca
2009On the Average Size of Glushkov's Automata.
Cyril Nicaud
2009One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.
Sicco Verwer, Mathijs de Weerdt, Cees Witteveen
2009Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization.
Bernard Boigelot, Jean-François Degbomont
2009Picture Languages Generated by Assembling Tiles.
Paola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri
2009Prediction of Creole Emergence in Spatial Language Dynamics.
Makoto Nakamura, Takashi Hashimoto, Satoshi Tojo
2009Recent Developments in Algorithmic Teaching.
Frank J. Balbach, Thomas Zeugmann
2009Refinement and Consistency of Timed Modal Specifications.
Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet
2009Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights.
Tobias Berg, Harald Hempel
2009Rigid Tree Automata.
Florent Jacquemard, Francis Klay, Camille Vacher
2009Segmentation Charts for Czech - Relations among Segments in Complex Sentences.
Markéta Lopatková, Tomás Holan
2009Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching.
Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré
2009State Complexity of Combined Operations for Prefix-Free Regular Languages.
Yo-Sub Han, Kai Salomaa, Sheng Yu
2009State Complexity of Nested Word Automata.
Kai Salomaa
2009Termination of Priority Rewriting.
Isabelle Gnaedig
2009The Fault Tolerance of NP-Hard Problems.
Christian Glaßer, Aduri Pavan, Stephen D. Travers
2009The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates.
Neil Moore
2009Tiling the Plane with a Fixed Number of Polyominoes.
Nicolas Ollinger
2009Towards a Taxonomy for ECFG and RRPG Parsing.
Kees Hemerik
2009Two Equivalent Regularizations for Tree Adjoining Grammars.
Anna Kasprzik
2009Undecidability of Operation Problems for T0L Languages and Subclasses.
Henning Bordihn, Markus Holzer, Martin Kutrib