default search action
7. LATA 2013: Tarragona, Spain
- Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe
:
Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Lecture Notes in Computer Science 7810, Springer 2013, ISBN 978-3-642-37063-2
Invited Talks
- Jin-Yi Cai:
Complexity Dichotomy for Counting Problems. 1-11 - Kousha Etessami:
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. 12 - Luke Ong
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking. 13-41 - Joël Ouaknine:
Discrete Linear Dynamical Systems. 42 - Thomas Schwentick:
XML Schema Management: A Challenge for Automata Theory. 43
Regular Papers
- Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan:
On the Complexity of Shortest Path Problems on Discounted Cost Graphs. 44-55 - Takahito Aoto, Munehiro Iwami:
Termination of Rule-Based Calculi for Uniform Semi-Unification. 56-67 - Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages. 68-79 - Parisa Babaali, Christopher Knaplund:
On the Construction of a Family of Automata That Are Generically Non-minimal. 80-91 - Sebastian Bala, Dariusz Jackowski:
Limited Non-determinism Hierarchy of Counter Automata. 92-103 - Sebastian Bala, Artur Koninski:
Unambiguous Automata Denoting Finitely Sequential Functions. 104-115 - Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk:
Duplication-Loss Genome Alignment: Complexity and Algorithm. 116-127 - Fabrizio Biondi, Axel Legay, Bo Friis Nielsen
Maximizing Entropy over Markov Processes. 128-140 - Johanna Björklund
MAT Learning of Universal Automata. 141-152 - Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox
A Graph Polynomial Approach to Primitivity. 153-164 - Francine Blanchet-Sadri, Justin Lazarow:
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. 165-176 - Benedikt Bollig, Aiswarya Cyriac
Dynamic Communicating Automata and Branching High-Level MSCs. 177-189 - Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly Pushdown Automata: Universality and Inclusion via Antichains. 190-201 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. 202-213 - Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin:
How to Travel between Languages. 214-225 - Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution Information Rate for Some Classes of Automata. 226-237 - Giorgio Delzanno, Riccardo Traverso:
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks. 238-249 - Xiaojie Deng, Yu Zhang, Yuxin Deng
The Buffered π-Calculus: A Model for Concurrent Languages. 250-261 - Jörg Endrullis
Mix-Automatic Sequences. 262-274 - Henning Fernau
A Multivariate Analysis of Some DFA Problems. 275-286 - Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan:
On the Size Complexity of Deterministic Frequency Automata. 287-298 - Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. 299-310 - Daniel Goc, Kalle Saari, Jeffrey O. Shallit:
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. 311-322 - Stuart Haber, William G. Horne, Pratyusa K. Manadhata, Miranda Mowbray, Prasad Rao:
Efficient Submatch Extraction for Practical Regular Expressions. 323-334 - Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiwara:
Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers. 335-346 - Milka Hutagalung, Martin Lange, Étienne Lozes:
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. 347-358 - Oscar H. Ibarra, Bala Ravikumar:
On Bounded Languages and Reversal-Bounded Automata. 359-370 - Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. 371-382 - Tomasz Kociumaka
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. 383-394 - Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi:
From Regular Tree Expression to Position Tree Automaton. 395-406 - Michael Luttenberger, Maximilian Schlund:
Convergence of Newton's Method over Commutative Semirings. 407-418 - Brink van der Merwe, Mark Farag, Jaco Geldenhuys:
Counting Minimal Symmetric Difference NFAs. 419-430 - Angelo Montanari, Pietro Sala
Interval Logics and ωB-Regular Languages. 431-443 - Katsuhiko Nakamura, Keita Imada:
Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars. 444-455 - Friedrich Otto:
Asynchronous PC Systems of Pushdown Automata. 456-467 - Karin Quaas:
Model Checking Metric Temporal Logic over Automata with One Counter. 468-479 - Jurriaan Rot, Marcello M. Bonsangue
Coinductive Proof Techniques for Language Equivalence. 480-492 - Luke Schaeffer:
Ostrowski Numeration and the Local Period of Sturmian Words. 493-503 - Victor L. Selivanov, Anton Konovalov:
Boolean Algebras of Regular ω-Languages. 504-515 - Eli Shamir:
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. 516-522 - Seppo Sippu, Eljas Soisalon-Soininen:
Online Matching of Multiple Regular Patterns with Gaps and Character Classes. 523-534 - Tim Smith
Infiniteness and Boundedness in 0L, DT0L, and T0L Systems. 535-546 - Rodrigo de Souza:
Uniformisation of Two-Way Transducers. 547-558 - Olga Tveretina:
A Conditional Superpolynomial Lower Bound for Extended Resolution. 559-569 - Stanislav Zák, Jirí Síma:
A Turing Machine Distance Hierarchy. 570-578
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-28 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: