Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. LATA 2015: Nice, France
- Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
:
Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Lecture Notes in Computer Science 8977, Springer 2015, ISBN 978-3-319-15578-4
Invited Talks
- Marco Autili, Paola Inverardi, Filippo Mignosi, Romina Spalazzese, Massimo Tivoli:
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications. 3-24 - Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski:
Automated Program Verification. 25-46 - Johann A. Makowsky, Nadia Labai:
Hankel Matrices: From Words to Graphs (Extended Abstract). 47-55 - Giancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron:
Complexity Classes for Membrane Systems: A Survey. 56-69 - Antonio Restivo:
The Shuffle Product: New Research Directions. 70-81
Algorithms
- Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. 85-96 - Johanna Björklund, Frank Drewes, Niklas Zechner:
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. 97-108 - Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. 109-120 - Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Frequent Pattern Mining with Non-overlapping Inversions. 121-132 - H. K. Dai, Zhu Wang:
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. 133-144 - Hernán Ponce de León, Andrey Mokhov:
Building Bridges Between Sets of Partial Orders. 145-160 - Vojtech Vorel, Adam Roman:
Complexity of Road Coloring with Prescribed Reset Words. 161-172
Automata, Logic, and Concurrency
- Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for Unordered Trees with Data Constraints on Siblings. 175-187 - Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. 188-199 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. 200-211 - François Gonze, Raphaël M. Jungers:
On the Synchronizing Probability Function and the Triple Rendezvous Time - New Approaches to Černý's Conjecture. 212-223 - Vesa Halava, Reino Niskanen, Igor Potapov:
On Robot Games of Degree Two. 224-236 - Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable. 237-248 - Rui Li, Yiguang Hong:
On Observability of Automata Networks via Computational Algebra. 249-262 - Nicolas Peltier:
Reasoning on Schemas of Formulas: An Automata-Based Approach. 263-274 - Martin Sulzmann, Peter Thiemann:
Derivatives for Regular Shuffle Expressions. 275-286 - Peter Thiemann, Martin Sulzmann:
From \omega -Regular Expressions to Büchi Automata via Partial Derivatives. 287-298 - Guillaume Verdier, Jean-Baptiste Raclet:
Quotient of Acceptance Specifications Under Reachability Constraints. 299-311
Codes, Semigroups, and Symbolic Dynamics
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Structure and Measure of a Decidable Class of Two-dimensional Codes. 315-327 - Thibault Godin, Ines Klimann, Matthieu Picantin:
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. 328-339 - Luis-Miguel Lopez, Philippe Narbel:
Coding Non-orientable Laminations. 340-352 - Pavel Panteleev:
Preset Distinguishing Sequences and Diameter of Transformation Semigroups. 353-364 - Charalampos Zinoviadis:
Hierarchy and Expansiveness in 2D Subshifts of Finite Type. 365-377
Combinatorics on Words
- Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
On the Number of Closed Factors in a Word. 381-390 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. 391-401 - Guilhem Gamard, Gwénaël Richomme:
Coverability in Two Dimensions. 402-413 - Jana Hadravová, Stepan Holub:
Equation x^iy^jx^k=u^iv^ju^k in Words. 414-423 - Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter:
Square-Free Words over Partially Commutative Alphabets. 424-435 - Ananda Chandra Nayak, Kalpesh Kapoor:
On the Language of Primitive Partial Words. 436-445
Complexity and Recursive Functions
- Eric Allender, Ian Mertz:
Complexity of Regular Functions. 449-460 - Kazuyuki Amano, Atsushi Saito:
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. 461-472 - Georg Bachmeier, Michael Luttenberger, Maximilian Schlund:
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. 473-485 - Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A Game Characterisation of Tree-like Q-resolution Size. 486-498 - Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence Relations, Succession Rules, and the Positivity Problem. 499-510 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures. 511-523 - Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration for Modification Problems. 524-536 - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Preimage Problems for Reaction Systems. 537-548 - Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. 549-560
Compression, Inference, Pattern Matching, and Model Checking
- Ala-Eddine Ben Salem:
Single-Pass Testing Automata for LTL Model Checking. 563-576 - Philip Bille, Inge Li Gørtz, Søren Vind:
Compressed Data Structures for Range Searching. 577-586 - Alberto Policriti, Nicola Gigante, Nicola Prezza:
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. 587-598 - Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas:
Backward Linearised Tree Pattern Matching. 599-610 - Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto:
BFS-Based Symmetry Breaking Predicates for DFA Identification. 611-622 - Ryo Yoshinaka:
Learning Conjunctive Grammars and Contextual Binary Feature Grammars. 623-635
Graphs, Term Rewriting, and Networks
- Raphaël Bailly, François Denis, Guillaume Rabusseau:
Recognizable Series on Hypergraphs. 639-651 - Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards More Precise Rewriting Approximations. 652-663 - Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: The End Game. 664-675 - Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. 676-688 - Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Order Structures for Subclasses of Generalised Traces. 689-700
Transducers, Tree Automata, and Weighted Automata
- Parvaneh Babari, Manfred Droste:
A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic. 703-715 - Luc Boasson, Olivier Carton:
Rational Selecting Relations and Selectors. 716-726 - Peter Leupold, Norbert Hundeshagen:
A Hierarchy of Transducing Observer Systems. 727-738 - Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Sublinear DTD Validity. 739-751
a service of 
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-04-25 04:52 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:
