default search action
7. LATA 2014: Madrid, Spain
- Adrian-Horia Dediu
, Carlos Martín-Vide, José Luis Sierra-Rodríguez, Bianca Truthe
Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings. Lecture Notes in Computer Science 8370, Springer 2014, ISBN 978-3-319-04920-5
Invited Talks
- Javier Esparza
A Brief History of Strahler Numbers. 1-13 - Oscar H. Ibarra, Bala Ravikumar:
On the Parikh Membership Problem for FAs, PDAs, and CMs. 14-31 - Sanjeev Khanna:
Matchings, Random Walks, and Sampling. 32-33 - Helmut Seidl, Máté Kovács:
Interprocedural Information Flow Analysis of XML Processors. 34-61
Regular Papers
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman:
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata. 62-75 - Gadi Aleksandrowicz, Andrei Asinowski
Formulae for Polyominoes on Twisted Cylinders. 76-87 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Picture Codes with Finite Deciphering Delay. 88-100 - Fernando Arroyo
Networks of Polarized Evolutionary Processors Are Computationally Complete. 101-112 - Zuzana Bednárová, Viliam Geffert:
Two Double-Exponential Gaps for Automata with a Limited Pushdown. 113-125 - Niko Beerenwinkel, Stefano Beretta
Covering Pairs in Directed Acyclic Graphs. 126-137 - Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi:
Efficient List-Based Computation of the String Subsequence Kernel. 138-148 - Béatrice Bérard, Olivier Carton
Channel Synthesis Revisited. 149-160 - Eike Best, Raymond R. Devillers:
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. 161-172 - Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse:
Computing Depths of Patterns. 173-185 - Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
Solving Equations on Words with Morphisms and Antimorphisms. 186-197 - Alexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay
On the Arithmetics of Discrete Figures. 198-209 - Joan Boyar
On the List Update Problem with Advice. 210-221 - Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
Shift-Reduce Parsers for Transition Networks. 222-235 - Daniel Bundala, Jakub Zavodny:
Optimal Sorting Networks. 236-247 - Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil
Satisfiability for MTL and TPTL over Non-monotonic Data Words. 248-259 - Pascal Caron, Marianne Flouret, Ludovic Mignot
(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization. 260-272 - Anton Cerný:
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms. 273-284 - Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
Succinct Encodings of Graph Isomorphism. 285-296 - Alberto Dennunzio, Enrico Formenti
Extremal Combinatorics of Reaction Systems. 297-307 - Liang Ding, Abdul Samad, Xingran Xue, Xiuzhen Huang, Russell L. Malmberg, Liming Cai:
Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling. 308-322 - Manfred Droste, Stefan Dück:
Weighted Automata and Logics for Infinite Nested Words. 323-334 - Etienne Dubourg, David Janin:
Algebraic Tools for the Overlapping Tile Product. 335-346 - Bertram Felgenhauer, René Thiemann
Reachability Analysis with State-Compatible Automata. 347-359 - Bernd Finkbeiner, Hazem Torfah
Counting Models of Linear-Time Temporal Logic. 360-371 - Enrico Formenti
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. 372-383 - Matthias Gallé, Matías Tealdi:
On Context-Diverse Repeats and Their Incremental Computation. 384-395 - Pierre Ganty, Ahmed Rezine:
Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. 396-408 - Matthew Gwynne, Oliver Kullmann:
On SAT Representations of XOR Constraints. 409-420 - Rob Gysel:
Minimal Triangulation Algorithms for Perfect Phylogeny Problems. 421-432 - Dariusz Kalocinski:
On Computability and Learnability of the Pumping Lemma Function. 433-440 - Hanna Klaudel, Maciej Koutny, Zhenhua Duan:
Interval Temporal Logic Semantics of Box Algebra. 441-452 - Joachim Klein
Are Good-for-Games Automata Good for Probabilistic Model Checking? 453-465 - Sang-Ki Ko
Top-Down Tree Edit-Distance of Regular Tree Languages. 466-477 - Marius Konitzer, Hans Ulrich Simon
DFA with a Bounded Activity Level. 478-489 - Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko
Learning Sequential Tree-to-Word Transducers. 490-502 - Haizhou Li, François Pinet
Probabilistic Simulation for Probabilistic Data-Aware Business Processes. 503-515 - María Martos-Salgado, Fernando Rosa-Velardo
Expressiveness of Dynamic Networks of Timed Petri Nets. 516-527 - Zeinab Mazadi, Ziyuan Gao, Sandra Zilles:
Distinguishing Pattern Languages with Membership Examples. 528-540 - Friedrich Otto, Frantisek Mráz
Extended Two-Way Ordered Restarting Automata for Picture Languages. 541-552 - Daniel Prusa
Weight-Reducing Hennie Machines and Their Descriptional Complexity. 553-564 - Paul Tarau:
Computing with Catalan Families. 565-575 - Vojtech Vorel:
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata. 576-587 - Thomas Weidner:
Probabilistic ω-Regular Expressions. 588-600 - Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the State Complexity of Semi-quantum Finite Automata. 601-612
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-12-19 22:02 CET 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: