↓ Skip to main content

Mathematical Foundations of Computer Science 2015

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 2015'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Minimal and Monotone Minimal Perfect Hash Functions
  3. Altmetric Badge
    Chapter 2 Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
  4. Altmetric Badge
    Chapter 3 Reversible and Irreversible Computations of Deterministic Finite-State Devices
  5. Altmetric Badge
    Chapter 4 Robust Inference and Local Algorithms
  6. Altmetric Badge
    Chapter 5 Uniform Generation in Trace Monoids
  7. Altmetric Badge
    Chapter 6 When Are Prime Formulae Characteristic?
  8. Altmetric Badge
    Chapter 7 Stochastization of Weighted Automata
  9. Altmetric Badge
    Chapter 8 Algebraic Synchronization Criterion and Computing Reset Words
  10. Altmetric Badge
    Chapter 9 Recurrence Function on Sturmian Words: A Probabilistic Study
  11. Altmetric Badge
    Chapter 10 Exponential-Size Model Property for PDL with Separating Parallel Composition
  12. Altmetric Badge
    Chapter 11 A Circuit Complexity Approach to Transductions
  13. Altmetric Badge
    Chapter 12 Locally Chain-Parsable Languages
  14. Altmetric Badge
    Chapter 13 Classes of Languages Generated by the Kleene Star of a Word
  15. Altmetric Badge
    Chapter 14 Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
  16. Altmetric Badge
    Chapter 15 Weighted Automata and Logics on Graphs
  17. Altmetric Badge
    Chapter 16 Longest Gapped Repeats and Palindromes
  18. Altmetric Badge
    Chapter 17 Quasiperiodicity and Non-computability in Tilings
  19. Altmetric Badge
    Chapter 18 The Transitivity Problem of Turing Machines
  20. Altmetric Badge
    Chapter 19 Strong Inapproximability of the Shortest Reset Word
  21. Altmetric Badge
    Chapter 20 Finitary Semantics of Linear Logic and Higher-Order Model-Checking
  22. Altmetric Badge
    Chapter 21 Complexity of Propositional Independence and Inclusion Logic
  23. Altmetric Badge
    Chapter 22 Modal Inclusion Logic: Being Lax is Simpler than Being Strict
  24. Altmetric Badge
    Chapter 23 Differential Bisimulation for a Markovian Process Algebra
  25. Altmetric Badge
    Chapter 24 On the Hardness of Almost–Sure Termination
  26. Altmetric Badge
    Chapter 25 Graphs Identified by Logics with Counting
  27. Altmetric Badge
    Chapter 26 Mathematical Foundations of Computer Science 2015
  28. Altmetric Badge
    Chapter 27 Ratio and Weight Quantiles
  29. Altmetric Badge
    Chapter 28 Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem
  30. Altmetric Badge
    Chapter 29 Definability by Weakly Deterministic Regular Expressions with Counters is Decidable
  31. Altmetric Badge
    Chapter 30 On the Complexity of Reconfiguration in Systems with Legacy Components
  32. Altmetric Badge
    Chapter 31 Eliminating Recursion from Monadic Datalog Programs on Trees
  33. Altmetric Badge
    Chapter 32 Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
  34. Altmetric Badge
    Chapter 33 Emergence on Decreasing Sandpile Models
  35. Altmetric Badge
    Chapter 34 Lost in Self-Stabilization
  36. Altmetric Badge
    Chapter 35 Equations and Coequations for Weighted Automata
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Mathematical Foundations of Computer Science 2015
Published by
Springer, Berlin, Heidelberg, January 2015
DOI 10.1007/978-3-662-48057-1
ISBNs
978-3-66-248056-4, 978-3-66-248057-1
Editors

Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Researcher 1 25%
Lecturer > Senior Lecturer 1 25%
Student > Master 1 25%
Readers by discipline Count As %
Computer Science 4 100%