default search action
10. LATA 2016: Prague, Czech Republic
- Adrian-Horia Dediu, Jan Janousek, Carlos Martín-Vide, Bianca Truthe
:
Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings. Lecture Notes in Computer Science 9618, Springer 2016, ISBN 978-3-319-29999-0
Invited Talks
- Romain Brenguier, Lorenzo Clemente, Paul Hunter
Non-Zero Sum Games for Reactive Synthesis. 3-23 - Martin Grohe
Tangles and Connectivity in Graphs. 24-41 - Giovanni Pighizzini:
Restricted Turing Machines and Language Recognition. 42-56 - Frank Wolter
Automata for Ontologies. 57-60
Automata and Logic
- Franz Baader
Reasoning with Prototypes in the Description Logic ALC ALC Using Weighted Tree Automata. 63-75 - Parvaneh Babari
+\omega + ω -Picture Languages Recognizable by Büchi-Tiling Systems. 76-88 - Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi:
A Logical Characterization for Dense-Time Visibly Pushdown Automata. 89-101 - Dana Fisman
A Complexity Measure on Büchi Automata. 102-113 - Vahid Hashemi
Compositional Bisimulation Minimization for Interval Markov Decision Processes. 114-126 - Heiko Vogler, Manfred Droste, Luisa Herrmann:
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. 127-139
Automata and Words
- Rajeev Alur, Dana Fisman
Colored Nested Words. 143-155 - Martin Kutrib
Input-Driven Queue Automata with Internal Transductions. 156-167 - Klaus Meer, Ameen Naif:
Periodic Generalized Automata over the Reals. 168-180 - Rick Smetsers, Joshua Moerman
Minimal Separating Sequences for All Pairs of States. 181-193 - Martin Sulzmann, Peter Thiemann:
Forkable Regular Expressions. 194-206 - Hélène Touzet
On the Levenshtein Automaton and the Size of the Neighbourhood of a Word. 207-218
Combinatorics on Words
- Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay
Parallelogram Morphisms and Circular Codes. 221-232 - Ananda Chandra Nayak, Amit Kumar Srivastava:
On Del-Robust Primitive Partial Words with One Hole. 233-244 - Maxime Crochemore
Optimal Bounds for Computing \alpha α -gapped Repeats. 245-255
Complexity
- Kazuyuki Amano:
On XOR Lemma for Polynomial Threshold Weight and Length. 259-269 - Yu Chen, Xiaotie Deng
The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line. 270-282 - Silke Czarnetzki, Andreas Krebs:
Using Duality in Circuit Complexity. 283-294 - Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu:
The Minimum Entropy Submodular Set Cover Problem. 295-306 - Orna Kupferman, Sarai Sheinvald:
On the Capacity of Capacitated Automata. 307-319 - Holger Spakowski:
On Limited Nondeterminism and ACC Circuit Lower Bounds. 320-329 - Kunihiro Wasa
The Complexity of Induced Tree Reconfiguration Problems. 330-342
Grammars
- Stefano Crespi-Reghizzi, Pierluigi San Pietro
The Missing Case in Chomsky-Schützenberger Theorem. 345-358 - Séverine Fratani, El Makki Voundy:
Homomorphic Characterizations of Indexed Languages. 359-370 - Makoto Kanazawa:
Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy. 371-383
Grammatical Inference, Algorithmic Learning, and Patterns
- Sebastian Berndt, Rüdiger Reischuk:
Steganography Based on Pattern Languages. 387-399 - Guen-Hae Kim, Sang-Ki Ko
Inferring a Relax NG Schema from XML Documents. 400-411 - Atsuyoshi Nakamura
Noise Free Multi-armed Bandit Game. 412-423
Graphs, Trees, and Weighted Automata
- Johannes Blum, Frank Drewes:
Properties of Regular DAG Languages. 427-438 - Adrien Boiret:
Normal Form on Linear Tree-to-Word Transducers. 439-451 - Manfred Droste, Zoltán Fülöp, Doreen Götze:
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. 452-463 - Nadia Labai, Johann A. Makowsky:
Hankel Matrices for Weighted Visibly Pushdown Automata. 464-477 - Johannes Osterholzer, Toni Dietze, Luisa Herrmann:
Linear Context-Free Tree Languages and Inverse Homomorphisms. 478-489
Language Varieties and Semigroups
- Paul C. Bell
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. 493-505 - Tatiana Baginová Jajcayová:
The Word Problem for HNN-extensions of Free Inverse Semigroups. 506-517
Parsing
- Henrik Björklund, Frank Drewes, Petter Ericson
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. 521-532 - Sanguthevar Rajasekaran, Marius Nicolae:
An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time. 533-546
System Analysis and Program Verification
- Nathalie Bertrand
Accurate Approximate Diagnosability of Stochastic Systems. 549-561 - Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Proof-Based Synthesis of Sorting Algorithms for Trees. 562-575
Unconventional Models of Computation
- Holger Bock Axelsen, Markus Holzer
Reversible Shrinking Two-Pushdown Automata. 579-591 - Alberto Dennunzio, Enrico Formenti
Reachability in Resource-Bounded Reaction Systems. 592-602 - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye:
Canonical Multi-target Toffoli Circuits. 603-616
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-18 18:30 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: