↓ Skip to main content

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
  3. Altmetric Badge
    Chapter 2 Newton’s Method for ω-Continuous Semirings
  4. Altmetric Badge
    Chapter 3 The Tractability Frontier for NFA Minimization
  5. Altmetric Badge
    Chapter 4 Finite Automata, Digraph Connectivity, and Regular Expression Size
  6. Altmetric Badge
    Chapter 5 Leftist Grammars Are Non-primitive Recursive
  7. Altmetric Badge
    Chapter 6 On the Computational Completeness of Equations over Sets of Natural Numbers
  8. Altmetric Badge
    Chapter 7 Placement Inference for a Client-Server Calculus
  9. Altmetric Badge
    Chapter 8 Extended pi-Calculi
  10. Altmetric Badge
    Chapter 9 Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
  11. Altmetric Badge
    Chapter 10 On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
  12. Altmetric Badge
    Chapter 11 On Expressiveness and Complexity in Real-Time Model Checking
  13. Altmetric Badge
    Chapter 12 STORMED Hybrid Systems
  14. Altmetric Badge
    Chapter 13 Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
  15. Altmetric Badge
    Chapter 14 On Datalog vs. LFP
  16. Altmetric Badge
    Chapter 15 Directed st-Connectivity Is Not Expressible in Symmetric Datalog
  17. Altmetric Badge
    Chapter 16 Non-dichotomies in Constraint Satisfaction Complexity
  18. Altmetric Badge
    Chapter 17 Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
  19. Altmetric Badge
    Chapter 18 When Does Partial Commutative Closure Preserve Regularity?
  20. Altmetric Badge
    Chapter 19 Weighted Logics for Nested Words and Algebraic Formal Power Series
  21. Altmetric Badge
    Chapter 20 Tree Languages Defined in First-Order Logic with One Quantifier Alternation
  22. Altmetric Badge
    Chapter 21 Duality and Equational Theory of Regular Languages
  23. Altmetric Badge
    Chapter 22 Reversible Flowchart Languages and the Structured Reversible Program Theorem
  24. Altmetric Badge
    Chapter 23 Attribute Grammars and Categorical Semantics
  25. Altmetric Badge
    Chapter 24 A Domain Theoretic Model of Qubit Channels
  26. Altmetric Badge
    Chapter 25 Interacting Quantum Observables
  27. Altmetric Badge
    Chapter 26 Perpetuality for Full and Safe Composition (in a Constructive Setting)
  28. Altmetric Badge
    Chapter 27 A System F with Call-by-Name Exceptions
  29. Altmetric Badge
    Chapter 28 Linear Logical Algorithms
  30. Altmetric Badge
    Chapter 29 A Simple Model of Separation Logic for Higher-Order Store
  31. Altmetric Badge
    Chapter 30 Open Implication
  32. Altmetric Badge
    Chapter 31 ATL* Satisfiability Is 2EXPTIME-Complete
  33. Altmetric Badge
    Chapter 32 Visibly Pushdown Transducers
  34. Altmetric Badge
    Chapter 33 The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
  35. Altmetric Badge
    Chapter 34 Analyzing Context-Free Grammars Using an Incremental SAT Solver
  36. Altmetric Badge
    Chapter 35 Weak Pseudorandom Functions in Minicrypt
  37. Altmetric Badge
    Chapter 36 On Black-Box Ring Extraction and Integer Factorization
  38. Altmetric Badge
    Chapter 37 Extractable Perfectly One-Way Functions
  39. Altmetric Badge
    Chapter 38 Error-Tolerant Combiners for Oblivious Primitives
  40. Altmetric Badge
    Chapter 39 Asynchronous Multi-Party Computation with Quadratic Communication
  41. Altmetric Badge
    Chapter 40 Improved Garbled Circuit: Free XOR Gates and Applications
  42. Altmetric Badge
    Chapter 41 Improving the Round Complexity of VSS in Point-to-Point Networks
  43. Altmetric Badge
    Chapter 42 How to Protect Yourself without Perfect Shredding
  44. Altmetric Badge
    Chapter 43 Universally Composable Undeniable Signature
  45. Altmetric Badge
    Chapter 44 Interactive PCP
  46. Altmetric Badge
    Chapter 45 Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
  47. Altmetric Badge
    Chapter 46 Delegating Capabilities in Predicate Encryption Systems
  48. Altmetric Badge
    Chapter 47 Bounded Ciphertext Policy Attribute Based Encryption
  49. Altmetric Badge
    Chapter 48 Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
  50. Altmetric Badge
    Chapter 49 Composable Security in the Bounded-Quantum-Storage Model
  51. Altmetric Badge
    Chapter 50 On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
  52. Altmetric Badge
    Chapter 51 History-Independent Cuckoo Hashing
  53. Altmetric Badge
    Chapter 52 Building a Collision-Resistant Compression Function from Non-compressing Primitives
  54. Altmetric Badge
    Chapter 53 Robust Multi-property Combiners for Hash Functions Revisited
  55. Altmetric Badge
    Chapter 54 Homomorphic Encryption with CCA Security
  56. Altmetric Badge
    Chapter 55 How to Encrypt with the LPN Problem
  57. Altmetric Badge
    Chapter 56 Could SFLASH be Repaired?
  58. Altmetric Badge
    Chapter 57 Password Mistyping in Two-Factor-Authenticated Key Exchange
  59. Altmetric Badge
    Chapter 58 Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
Attention for Chapter 33: The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Altmetric Badge

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
20 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.
Chapter title
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Chapter number 33
Book title
Automata, Languages and Programming
Published by
Springer, Berlin, Heidelberg, July 2008
DOI 10.1007/978-3-540-70583-3_33
Book ISBNs
978-3-54-070582-6, 978-3-54-070583-3
Authors

Thomas Colcombet, Christof Löding

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 20 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 30%
Student > Master 4 20%
Researcher 4 20%
Professor 1 5%
Lecturer 1 5%
Other 1 5%
Unknown 3 15%
Readers by discipline Count As %
Computer Science 15 75%
Mathematics 1 5%
Physics and Astronomy 1 5%
Unknown 3 15%