Advertisement

Mathematical Foundations of Computer Science 2015

40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I

  • Giuseppe F Italiano
  • Giovanni Pighizzini
  • Donald T. Sannella
Conference proceedings MFCS 2015

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9234)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9234)

Table of contents

  1. Front Matter
    Pages I-XXVI
    PDF

  2. Invited Contributions

    1. Front Matter
      Pages 1-1
      PDF
    2. Minimal and Monotone Minimal Perfect Hash Functions
      Paolo Boldi
      Pages 3-17
    3. Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
      Zoltán Ésik
      Pages 18-37
    4. Reversible and Irreversible Computations of Deterministic Finite-State Devices
      Martin Kutrib
      Pages 38-52
    5. Robust Inference and Local Algorithms
      Yishay Mansour
      Pages 53-60

  3. Logic, Semantics, Automata and Theory of Programming

    1. Front Matter
      Pages 61-61
      PDF
    2. Uniform Generation in Trace Monoids
      Samy Abbes, Jean Mairesse
      Pages 63-75
    3. When Are Prime Formulae Characteristic?
      L. Aceto, D. Della Monica, I. Fábregas, A. Ingólfsdóttir
      Pages 76-88
    4. Stochastization of Weighted Automata
      Guy Avni, Orna Kupferman
      Pages 89-102
    5. Algebraic Synchronization Criterion and Computing Reset Words
      Mikhail Berlinkov, Marek Szykuła
      Pages 103-115
    6. Recurrence Function on Sturmian Words: A Probabilistic Study
      Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola
      Pages 116-128
    7. Exponential-Size Model Property for PDL with Separating Parallel Composition
      Joseph Boudou
      Pages 129-140
    8. A Circuit Complexity Approach to Transductions
      Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman
      Pages 141-153
    9. Locally Chain-Parsable Languages
      Stefano Crespi Reghizzi, Violetta Lonati, Dino Mandrioli, Matteo Pradella
      Pages 154-166
    10. Classes of Languages Generated by the Kleene Star of a Word
      Laure Daviaud, Charles Paperman
      Pages 167-178
    11. Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
      Cătălin Dima, Bastien Maubert, Sophie Pinchinat
      Pages 179-191
    12. Weighted Automata and Logics on Graphs
      Manfred Droste, Stefan Dück
      Pages 192-204
    13. Longest Gapped Repeats and Palindromes
      Marius Dumitran, Florin Manea
      Pages 205-217
    14. Quasiperiodicity and Non-computability in Tilings
      Bruno Durand, Andrei Romashchenko
      Pages 218-230
    15. The Transitivity Problem of Turing Machines
      Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés
      Pages 231-242
    16. Strong Inapproximability of the Shortest Reset Word
      Paweł Gawrychowski, Damian Straszak
      Pages 243-255
    17. Finitary Semantics of Linear Logic and Higher-Order Model-Checking
      Charles Grellois, Paul-André Melliès
      Pages 256-268
    18. Complexity of Propositional Independence and Inclusion Logic
      Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
      Pages 269-280
    19. Modal Inclusion Logic: Being Lax is Simpler than Being Strict
      Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
      Pages 281-292
    20. Differential Bisimulation for a Markovian Process Algebra
      Giulio Iacobelli, Mirco Tribastone, Andrea Vandin
      Pages 293-306
    21. On the Hardness of Almost–Sure Termination
      Benjamin Lucien Kaminski, Joost-Pieter Katoen
      Pages 307-318
    22. Graphs Identified by Logics with Counting
      Sandra Kiefer, Pascal Schweitzer, Erkal Selman
      Pages 319-330
    23. Synchronizing Automata with Extremal Properties
      Andrzej Kisielewicz, Marek Szykuła
      Pages 331-343
    24. Ratio and Weight Quantiles
      Daniel Krähmann, Jana Schubert, Christel Baier, Clemens Dubslaff
      Pages 344-356
    25. Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem
      Victor Lagerkvist
      Pages 357-368
    26. Definability by Weakly Deterministic Regular Expressions with Counters is Decidable
      Markus Latte, Matthias Niewerth
      Pages 369-381
    27. On the Complexity of Reconfiguration in Systems with Legacy Components
      Jacopo Mauro, Gianluigi Zavattaro
      Pages 382-393
    28. Eliminating Recursion from Monadic Datalog Programs on Trees
      Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
      Pages 394-406
    29. Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
      Arno Pauly
      Pages 407-418
    30. Emergence on Decreasing Sandpile Models
      Kévin Perrot, Éric Rémila
      Pages 419-431
    31. Lost in Self-Stabilization
      Damien Regnault, Éric Rémila
      Pages 432-443
    32. Equations and Coequations for Weighted Automata
      Julian Salamanca, Marcello Bonsangue, Jan Rutten
      Pages 444-456
  4. Back Matter
    Pages 457-459
    PDF

Other volumes

  1. Mathematical Foundations of Computer Science 2015
    40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I
  2. Mathematical Foundations of Computer Science 2015
    40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II

About these proceedings

Introduction

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

Keywords

algebra and categories in computer science algorithmic game theory algorithmic learning theory algorithms and data structures approximation algorithms automata-computational complexity concurrency theory cryptography and security databases and knowledge-based systems distributed computing formal specifications foundations of computing grammars and formal languages lambda-calculus linear programming logic-networks parallel computing program development quantum computing semantics and verification of programs

Editors and affiliations

  • Giuseppe F Italiano
    • 1
  • Giovanni Pighizzini
    • 2
  • Donald T. Sannella
    • 3
  1. 1.Università di Roma "Tor Vergata"RomeItaly
  2. 2.Università degli Studi di MilanoMilanItaly
  3. 3.University of EdinburghEdinburghUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-48057-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2015
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-662-48056-4
  • Online ISBN 978-3-662-48057-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Materials & Steel
Automotive
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace