↓ Skip to main content
What is this page? Embed badge

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 Refined analysis and improvements on some factoring algorithms
  3. Altmetric Badge
    Chapter 2 Absolute primality of polynomials is decidable in random polynomial time in the number of variables
  4. Altmetric Badge
    Chapter 3 Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform
  5. Altmetric Badge
    Chapter 4 Cost tradeoffs in graph embeddings, with applications
  6. Altmetric Badge
    Chapter 5 Minimum s-t cut of a planar undirected network in o(n log2(n)) time
  7. Altmetric Badge
    Chapter 6 On the density of color-families
  8. Altmetric Badge
    Chapter 7 The implication problem for data dependencies
  9. Altmetric Badge
    Chapter 8 Characterizing data base Dependencies
  10. Altmetric Badge
    Chapter 9 Data flow analysis of applicative programs
  11. Altmetric Badge
    Chapter 10 Flow analysis of lambda expressions
  12. Altmetric Badge
    Chapter 11 Algorithmic specifications of abstract data types
  13. Altmetric Badge
    Chapter 12 Nondeterminism in abstract data types
  14. Altmetric Badge
    Chapter 13 A view of directions in relational database theory
  15. Altmetric Badge
    Chapter 14 A new characterization of the regular languages
  16. Altmetric Badge
    Chapter 15 Langages Reconnaissables et Codage Prefixe Pur
  17. Altmetric Badge
    Chapter 16 Passes, sweeps and visits
  18. Altmetric Badge
    Chapter 17 On LALR(k) testing
  19. Altmetric Badge
    Chapter 18 On size bounds for deterministic parsers
  20. Altmetric Badge
    Chapter 19 A decision procedure for the equivalence of two dpdas one of which is linear
  21. Altmetric Badge
    Chapter 20 The deducibility problem in Propositional Dynamic Logic
  22. Altmetric Badge
    Chapter 21 Finite models for deterministic propositional dynamic logic
  23. Altmetric Badge
    Chapter 22 Impartiality, justice and fairness: The ethics of concurrent termination
  24. Altmetric Badge
    Chapter 23 Computing a perfect strategy for n×n chess requires time exponential in n
  25. Altmetric Badge
    Chapter 24 On the complexity of simple arithmetic expressions
  26. Altmetric Badge
    Chapter 25 Proving lower bounds for linear decision trees
  27. Altmetric Badge
    Chapter 26 Parikh-bounded languages
  28. Altmetric Badge
    Chapter 27 Generalized Parikh mappings and homomorphisms
  29. Altmetric Badge
    Chapter 28 Chomsky-Schotzenberger representations for families of languages and grammatical types
  30. Altmetric Badge
    Chapter 29 Algebraically specified programming systems and Hoare's logic
  31. Altmetric Badge
    Chapter 30 Automatic construction of verification condition generators from hoare logics
  32. Altmetric Badge
    Chapter 31 Circular expressions: Elimination of static environments
  33. Altmetric Badge
    Chapter 32 An axiomatic approach to the Korenjak - Hopcroft algorithms
  34. Altmetric Badge
    Chapter 33 On the (generalized) post correspondence problem with lists of length 2
  35. Altmetric Badge
    Chapter 34 A sparse table implementation of priority queues
  36. Altmetric Badge
    Chapter 35 Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems
  37. Altmetric Badge
    Chapter 36 Termination of linear rewriting systems
  38. Altmetric Badge
    Chapter 37 Realizing an equational specification
  39. Altmetric Badge
    Chapter 38 A cook's tour of countable nondeterminism
  40. Altmetric Badge
    Chapter 39 The complexity of decision problems for finite-turn multicounter machines
  41. Altmetric Badge
    Chapter 40 Alternating multihead finite automata
  42. Altmetric Badge
    Chapter 41 The solution for the branching factor of the alpha-beta pruning algorithm
  43. Altmetric Badge
    Chapter 42 Uniform complexity and digital signatures
  44. Altmetric Badge
    Chapter 43 On the generation of cryptographically strong pseudo-random sequences
  45. Altmetric Badge
    Chapter 44 Measuring the expressive power of dynamic logics: An application of abstract model theory
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
7 Wikipedia pages
q&a
1 Q&A thread

Readers on

mendeley
3 Mendeley
Summary X Wikipedia Q&A
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
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-10843-2
ISBNs
978-3-54-010843-6, 978-3-54-038745-9
Editors

Even, Shimon, Kariv, Oded

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 33%
Student > Ph. D. Student 1 33%
Unspecified 1 33%
Readers by discipline Count As %
Unspecified 1 33%
Computer Science 1 33%
Social Sciences 1 33%

This page is provided by Altmetric.