default search action
40. MFCS 2015: Milan, Italy
- Giuseppe F. Italiano
, Giovanni Pighizzini, Donald Sannella:
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9234, Springer 2015, ISBN 978-3-662-48056-4
Invited Contributions
- Paolo Boldi
Minimal and Monotone Minimal Perfect Hash Functions. 3-17 - Zoltán Ésik:
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview. 18-37 - Martin Kutrib
Reversible and Irreversible Computations of Deterministic Finite-State Devices. 38-52 - Yishay Mansour:
Robust Inference and Local Algorithms. 53-60
Logic, Semantics, Automata and Theory of Programming
- Samy Abbes
Uniform Generation in Trace Monoids. 63-75 - Luca Aceto, Dario Della Monica
When Are Prime Formulae Characteristic? 76-88 - Guy Avni, Orna Kupferman:
Stochastization of Weighted Automata. 89-102 - Mikhail V. Berlinkov
Algebraic Synchronization Criterion and Computing Reset Words. 103-115 - Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola:
Recurrence Function on Sturmian Words: A Probabilistic Study. 116-128 - Joseph Boudou:
Exponential-Size Model Property for PDL with Separating Parallel Composition. 129-140 - Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman
A Circuit Complexity Approach to Transductions. 141-153 - Stefano Crespi-Reghizzi, Violetta Lonati
Locally Chain-Parsable Languages. 154-166 - Laure Daviaud
Classes of Languages Generated by the Kleene Star of a Word. 167-178 - Catalin Dima
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. 179-191 - Manfred Droste, Stefan Dück:
Weighted Automata and Logics on Graphs. 192-204 - Marius Dumitran, Florin Manea:
Longest Gapped Repeats and Palindromes. 205-217 - Bruno Durand, Andrei E. Romashchenko
Quasiperiodicity and Non-computability in Tilings. 218-230 - Anahí Gajardo
The Transitivity Problem of Turing Machines. 231-242 - Pawel Gawrychowski, Damian Straszak:
Strong Inapproximability of the Shortest Reset Word. 243-255 - Charles Grellois, Paul-André Melliès:
Finitary Semantics of Linear Logic and Higher-Order Model-Checking. 256-268 - Miika Hannula
Complexity of Propositional Independence and Inclusion Logic. 269-280 - Lauri Hella
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. 281-292 - Giulio Iacobelli
Differential Bisimulation for a Markovian Process Algebra. 293-306 - Benjamin Lucien Kaminski
On the Hardness of Almost-Sure Termination. 307-318 - Sandra Kiefer
Graphs Identified by Logics with Counting. 319-330 - Andrzej Kisielewicz, Marek Szykula
Synchronizing Automata with Extremal Properties. 331-343 - Daniel Krähmann, Jana Schubert, Christel Baier
Ratio and Weight Quantiles. 344-356 - Victor Lagerkvist:
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem. 357-368 - Markus Latte, Matthias Niewerth:
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable. 369-381 - Jacopo Mauro
On the Complexity of Reconfiguration in Systems with Legacy Components. 382-393 - Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski:
Eliminating Recursion from Monadic Datalog Programs on Trees. 394-406 - Arno Pauly
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). 407-418 - Kévin Perrot, Eric Rémila:
Emergence on Decreasing Sandpile Models. 419-431 - Damien Regnault, Eric Rémila:
Lost in Self-Stabilization. 432-443 - Julian Salamanca, Marcello M. Bonsangue
Equations and Coequations for Weighted Automata. 444-456
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 2025-01-10 18:19 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: