 |
7th International Conference on Language and Automata
Theory and Applications, LATA 2013,
Bilbao, Spain ![[Valid RSS]](images/valid-rss-rogers.png "[Valid RSS]") |
|
|
7th International Conference on Language and Automata
Theory and Applications, LATA 2013,
Bilbao, Spain |
(alphabetically ordered by author names)
| 1) | Rajeev Alur, Sampath Kannan, Kevin Tian and Yifei Yuan. On The Complexity of Shortest Path Problems on Discounted Cost Graphs |
| 2) | Takahito Aoto and Munehiro Iwami. Termination of Rule-Based Calculi for Uniform Semi-Unification |
| 3) | Aistis Atminas, Vadim Lozin and Mikhail Moshkov. Deciding WQO for Factorial Languages |
| 4) | Parisa Babaali and Christopher Knaplund. On the construction of a family of automata that are generically non-minimal |
| 5) | Sebastian Bala and Dariusz Jackowski. Limited Non-Determinism Hierarchy of Counter Automata |
| 6) | Sebastian Bala and Artur Koninski. Unambiguous Automata Denoting Finitely Sequential Functions |
| 7) | Billel Benzaid, Riccardo Dondi and Nadia El-Mabrouk. Duplication-Loss Genome Alignment: Complexity and Algorithm |
| 8) | Fabrizio Biondi, Andrzej Wasowski, Axel Legay and Bo Friis Nielsen. Maximizing Entropy over Markov Processes |
| 9) | Johanna Björklund, Henning Fernau and Anna Kasprzik. MAT Learning of Universal Automata |
| 10) | Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox and Joe Hidakatsu. A Graph Polynomial Approach to Primitivity |
| 11) | Francine Blanchet-Sadri and Justin Lazarow. Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem |
| 12) | Benedikt Bollig, Aiswarya Cyriac, Loic Helouet, Ahmet Kara and Thomas Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs |
| 13) | Véronique Bruyère, Marc Ducobu and Olivier Gauwin. Visibly Pushdown Automata: Universality and Inclusion via Antichains |
| 14) | Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne and Ludovic Mignot. Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions |
| 15) | Cewei Cui, Zhe Dang, Thomas R. Fischer and Oscar H. Ibarra. Execution Information Rate for Some Classes of Automata |
| 16) | Giorgio Delzanno and Riccardo Traverso. Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks |
| 17) | Xiaojie Deng, Yu Zhang, Yuxin Deng and Farong Zhong. The Buffered $\pi$-calculus: A Model for Concurrent Languages |
| 18) | Joerg Endrullis, Clemens Grabmayer and Dimitri Hendriks. Mix-Automatic Sequences |
| 19) | Henning Fernau, Pinar Heggernes and Yngve Villanger. A Multivariate Analysis of Some DFA Problems |
| 20) | Rusins Freivalds, Thomas Zeugmann and Grant Pogosyan. On the Size Complexity of Deterministic Frequency Automata |
| 21) | Daniel Goc, Kalle Saari and Jeffrey Shallit. Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences |
| 22) | Daniel Goc, Jeffrey Shallit and Hamoon Mousavi. On the number of unbordered factors |
| 23) | Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki and Toru Fujiwara. Determinacy and Subsumption for Single-valued Bottom-up Tree Transducers |
| 24) | Bill Horne, Stuart Haber, Pratyusa Manadhata, Miranda Mowbray and Prasad Rao. Efficient Submatch Extraction for Practical Regular Expression |
| 25) | Milka Hutagalung, Martin Lange and Etienne Lozes. Revealing vs. Concealing: More Simulation Games for Büchi Inclusion |
| 26) | Oscar Ibarra and Bala Ravikumar. On Bounded Languages and Reversal-Bounded Automata |
| 27) | Florent Jacquemard and Michael Rusinowitch. Rewrite Closure and CF Hedge Automata |
| 28) | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Linear-time version of Holub's algorithm for morphic imprimitivity testing |
| 29) | Eric Laugerotte, Nadia Ouali Sebti and Djelloul Ziadi. From regular tree expression to position tree automaton |
| 30) | Michael Luttenberger and Maximilian Schlund. Convergence of Newton's method over Commutative Semirings |
| 31) | Angelo Montanari and Pietro Sala. Interval logics and $\omega{B}$-regular languages |
| 32) | Katsuhiko Nakamura and Keita Imada. Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars |
| 33) | Friedrich Otto. Asynchronous PC systems of pushdown automata |
| 34) | Karin Quaas. Model Checking Metric Temporal Logic over Automata with one Counter |
| 35) | Jurriaan Rot, Marcello Bonsangue and Jan Rutten. Coinductive proof techniques for language equivalence |
| 36) | Sasha Rubin, Krishnendu Chatterjee and Siddhesh Chaubal. How to travel between languages |
| 37) | Luke Schaeffer. Ostrowski Numeration and the Local Period of Sturmian Words |
| 38) | Victor Selivanov and Anton Konovalov. Boolean Algebras of Regular omega-Languages |
| 39) | Eli Shamir. Pumping, Shrinking and Pronouns: from Context Free to Indexed Grammars |
| 40) | Seppo Sippu and Eljas Soisalon-Soininen. Online Matching of Multiple Regular Patterns with Gaps and Character Classes |
| 41) | Tim Smith. Infiniteness and Boundedness in 0L, DT0L, and T0L Systems |
| 42) | Rodrigo de Souza. Uniformisation of two-way transducers |
| 43) | Olga Tveretina. A Conditional Superpolynomial Lower Bound for Extended Resolution |