LATA C

52 papers

YearTitle / Authors
2010A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems.
Turlough Neary
2010A Fast Longest Common Subsequence Algorithm for Similar Strings.
Abdullah N. Arslan
2010A Hierarchical Classification of First-Order Recurrent Neural Networks.
Jérémie Cabessa, Alessandro E. P. Villa
2010A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks.
Reinhard Hemmerling, Katarína Smolenová, Winfried Kurth
2010A Randomized Numerical Aligner (rNA).
Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi
2010A Simple
Pablo Arrighi, Jonathan Grattage
2010Abelian Square-Free Partial Words.
Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons
2010Agreement and Cliticization in Italian: A Pregroup Analysis.
Claudia Casadio
2010Analysis of Communicating Automata.
Anca Muscholl
2010Arbology: Trees and Pushdown Automata.
Borivoj Melichar
2010Avoidable Binary Patterns in Partial Words.
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
2010CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages.
Benedek Nagy, Friedrich Otto
2010Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages.
Ryo Yoshinaka, Yuichi Kaji, Hiroyuki Seki
2010Choosing Word Occurrences for the Smallest Grammar Problem.
Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López
2010Complexity in Convex Languages.
Janusz A. Brzozowski
2010Complexity of Guided Insertion-Deletion in RNA-Editing.
Hans Zantema
2010Complexity of the Satisfiability Problem for a Class of Propositional Schemata.
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
2010Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata.
Nicolas Bousquet, Christof Löding
2010Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata.
Tobias Marschall, Sven Rahmann
2010Extending Stochastic Context-Free Grammars for an Application in Bioinformatics.
Frank Weinberg, Markus E. Nebel
2010Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach.
Christophe Costa Florêncio, Henning Fernau
2010Geometricity of Binary Regular Languages.
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
2010Grammar-Based Compression in a Streaming Model.
Travis Gagie, Pawel Gawrychowski
2010Hard Counting Problems for Partial Words.
Florin Manea, Catalin Tiseanu
2010Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem.
Sakthi Balan Muthiah, Parameswaran Seshan
2010Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings
Adrian-Horia Dediu, Henning Fernau, Carlos Martín-Vide
2010Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data.
Fernando Rosa-Velardo, Giorgio Delzanno
2010Learnability of Automatic Classes.
Sanjay Jain, Qinglong Luo, Frank Stephan
2010Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness.
Zhe Lin
2010On the Expressive Power of FO[ + ].
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2010On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT.
William Cruz-Santos, Guillermo Morales-Luna
2010On the Maximal Number of Cubic Runs in a String.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010Operator Precedence and the Visibly Pushdown Property.
Stefano Crespi-Reghizzi, Dino Mandrioli
2010Parametric Metric Interval Temporal Logic.
Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli
2010Post Correspondence Problem with Partially Commutative Alphabets.
Barbara Klunder, Wojciech Rytter
2010Pregroup Grammars with Letter Promotions.
Wojciech Buszkowski, Zhe Lin
2010Primitive Words Are Unavoidable for Context-Free Languages.
Peter Leupold
2010Restarting Automata with Structured Output and Functional Generative Description.
Martin Plátek, Frantisek Mráz, Markéta Lopatková
2010Reversible Pushdown Automata.
Martin Kutrib, Andreas Malcher
2010SA-REPC - Sequence Alignment with Regular Expression Path Constraint.
Nimrod Milo, Tamar Pinhas, Michal Ziv-Ukelson
2010Short Witnesses and Accepting Lassos in
Rüdiger Ehlers
2010Simplifying Regular Expressions.
Hermann Gruber, Stefan Gulan
2010Some Minimality Results on Biresidual and Biseparable Automata.
Hellis Tamm
2010String Extension Learning Using Lattices.
Anna Kasprzik, Timo Kötzing
2010The Copying Power of Well-Nested Multiple Context-Free Grammars.
Makoto Kanazawa, Sylvain Salvati
2010The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape.
Alexander A. Letichevsky, Arsen S. Shoukourian, Samvel K. Shoukourian
2010The Inclusion Problem for Regular Expressions.
Dag Hovland
2010Three Learnable Models for the Description of Language.
Alexander Clark
2010Untestable Properties Expressible with Four First-Order Quantifiers.
Charles Jordan, Thomas Zeugmann
2010Using Sums-of-Products for Non-standard Reasoning.
Rafael Peñaloza
2010Variable Automata over Infinite Alphabets.
Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2010Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R).
Neda Saeedloei, Gopal Gupta