↓ Skip to main content

Mathematical Foundations of Computer Science 2014

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Partial-Observation Stochastic Reachability and Parity Games
  3. Altmetric Badge
    Chapter 2 Random Deterministic Automata
  4. Altmetric Badge
    Chapter 3 Communication Complexity Theory: Thirty-Five Years of Set Disjointness
  5. Altmetric Badge
    Chapter 4 What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
  6. Altmetric Badge
    Chapter 5 Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
  7. Altmetric Badge
    Chapter 6 Sofic-Dyck Shifts
  8. Altmetric Badge
    Chapter 7 A Logical Characterization of Timed (non-)Regular Languages
  9. Altmetric Badge
    Chapter 8 Asymptotic Monadic Second-Order Logic
  10. Altmetric Badge
    Chapter 9 Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules
  11. Altmetric Badge
    Chapter 10 Alternating Parity Krivine Automata
  12. Altmetric Badge
    Chapter 11 Advances in Parametric Real-Time Reasoning
  13. Altmetric Badge
    Chapter 12 Universal Lyndon Words
  14. Altmetric Badge
    Chapter 13 Subword Complexity and Decomposition of the Set of Factors
  15. Altmetric Badge
    Chapter 14 Cyclic Complexity of Words
  16. Altmetric Badge
    Chapter 15 Classifying Recognizable Infinitary Trace Languages Using Word Automata
  17. Altmetric Badge
    Chapter 16 Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
  18. Altmetric Badge
    Chapter 17 An Algebraic Characterization of Unary Two-Way Transducers
  19. Altmetric Badge
    Chapter 18 Size-Change Abstraction and Max-Plus Automata
  20. Altmetric Badge
    Chapter 19 Alternating Vector Addition Systems with States
  21. Altmetric Badge
    Chapter 20 Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
  22. Altmetric Badge
    Chapter 21 Relating Nominal and Higher-Order Rewriting
  23. Altmetric Badge
    Chapter 22 Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
  24. Altmetric Badge
    Chapter 23 Two Recursively Inseparable Problems for Probabilistic Automata
  25. Altmetric Badge
    Chapter 24 Monadic Second-Order Logic with Arbitrary Monadic Predicates
  26. Altmetric Badge
    Chapter 25 Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
  27. Altmetric Badge
    Chapter 26 Measure Properties of Game Tree Languages
  28. Altmetric Badge
    Chapter 27 On Upper and Lower Bounds on the Length of Alternating Towers
  29. Altmetric Badge
    Chapter 28 L ax F : Side Conditions and External Evidence as Monads
  30. Altmetric Badge
    Chapter 29 The Monoid of Queue Actions
  31. Altmetric Badge
    Chapter 30 Undecidable Properties of Self-affine Sets and Multi-tape Automata
  32. Altmetric Badge
    Chapter 31 Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
  33. Altmetric Badge
    Chapter 32 A Unifying Approach for Multistack Pushdown Automata
  34. Altmetric Badge
    Chapter 33 Definability and Transformations for Cost Logics and Automatic Structures
  35. Altmetric Badge
    Chapter 34 Generalised Lyndon-Schützenberger Equations
  36. Altmetric Badge
    Chapter 35 Complexity of Equivalence and Learning for Multiplicity Tree Automata
  37. Altmetric Badge
    Chapter 36 Monadic Datalog and Regular Tree Pattern Queries
  38. Altmetric Badge
    Chapter 37 Model Checking Concurrent Recursive Programs Using Temporal Logics
  39. Altmetric Badge
    Chapter 38 Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals
  40. Altmetric Badge
    Chapter 39 Reachability in Pushdown Register Automata
  41. Altmetric Badge
    Chapter 40 A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures
  42. Altmetric Badge
    Chapter 41 Determinising Parity Automata
  43. Altmetric Badge
    Chapter 42 Tight Bounds for Complementing Parity Automata
  44. Altmetric Badge
    Chapter 43 On Infinite Words Determined by Indexed Languages
  45. Altmetric Badge
    Chapter 44 A Pumping Lemma for Two-Way Finite Transducers
  46. Altmetric Badge
    Chapter 45 Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems
  47. Altmetric Badge
    Chapter 46 The Dynamic Descriptive Complexity of k -Clique
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
4 tweeters
wikipedia
2 Wikipedia pages

Readers on

mendeley
1 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 2014
Published by
Springer Berlin Heidelberg, August 2014
DOI 10.1007/978-3-662-44522-8
ISBNs
978-3-66-244521-1, 978-3-66-244522-8
Editors

Csuhaj-Varjú, Erzsébet, Dietzfelbinger, Martin, Ésik, Zoltán

Twitter Demographics

The data shown below were collected from the profiles of 4 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%