↓ 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 The theory of data dependencies — An overview
  3. Altmetric Badge
    Chapter 2 The VLSI revolution in theoretical circles
  4. Altmetric Badge
    Chapter 3 Tuple sequences and indexes
  5. Altmetric Badge
    Chapter 4 The complexity of cubical graphs
  6. Altmetric Badge
    Chapter 5 P-generic sets
  7. Altmetric Badge
    Chapter 6 Functional dependencies and disjunctive existence constraints in database relations with null values
  8. Altmetric Badge
    Chapter 7 The algebra of recursively defined processes and the algebra of regular processes
  9. Altmetric Badge
    Chapter 8 Algebraic specification of exception handling and error recovery by means of declarations and equations
  10. Altmetric Badge
    Chapter 9 Building the minimal DFA for the set of all subwords of a word on-line in linear time
  11. Altmetric Badge
    Chapter 10 The complexity and decidability of separation
  12. Altmetric Badge
    Chapter 11 Concurrent transmissions in broadcast networks
  13. Altmetric Badge
    Chapter 12 Linear searching for a square in a word
  14. Altmetric Badge
    Chapter 13 Domain algebras
  15. Altmetric Badge
    Chapter 14 Principality results about some matrix languages families
  16. Altmetric Badge
    Chapter 15 Oriented equational clauses as a programming language
  17. Altmetric Badge
    Chapter 16 Relational algebra operations and sizes of relations
  18. Altmetric Badge
    Chapter 17 Some results about finite and infinite behaviours of a pushdown automaton
  19. Altmetric Badge
    Chapter 18 Automata, Languages and Programming
  20. Altmetric Badge
    Chapter 19 Communicating finite state machines with priority channels
  21. Altmetric Badge
    Chapter 20 A modal characterization of observational congruence on finite terms of CCS
  22. Altmetric Badge
    Chapter 21 Communication complexity
  23. Altmetric Badge
    Chapter 22 Space and time efficient simulations and characterizations of some restricted classes of PDAS
  24. Altmetric Badge
    Chapter 23 A complete axiom system for algebra of closed-regular expression
  25. Altmetric Badge
    Chapter 24 The complexity of finding minimum-length generator sequences
  26. Altmetric Badge
    Chapter 25 On probabilistic tape complexity and fast circuits for matrix inversion problems
  27. Altmetric Badge
    Chapter 26 On three-element codes
  28. Altmetric Badge
    Chapter 27 Recursion depth analysis for special tree traversal algorithms
  29. Altmetric Badge
    Chapter 28 Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem
  30. Altmetric Badge
    Chapter 29 Measures of presortedness and optimal sorting algorithms
  31. Altmetric Badge
    Chapter 30 Languages and inverse semigroups
  32. Altmetric Badge
    Chapter 31 Area-time optimal vlsi integer multiplier with minimum computation time
  33. Altmetric Badge
    Chapter 32 On the interpretation of infinite computations in logic programming
  34. Altmetric Badge
    Chapter 33 A linear time algorithm to solve the single function coarsest partition problem
  35. Altmetric Badge
    Chapter 34 Complexité des facteurs des mots infinis engendrés par morphismes itérés
  36. Altmetric Badge
    Chapter 35 Automates boustrophedon, semi-groupe de birget et monoide inversif libre
  37. Altmetric Badge
    Chapter 36 Probabilistic bidding gives optimal distributed resource allocation
  38. Altmetric Badge
    Chapter 37 Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness
  39. Altmetric Badge
    Chapter 38 Cancellation, pumping and permutation in formal languages
  40. Altmetric Badge
    Chapter 39 A hardware implementation of the CSP primitives and its verification
  41. Altmetric Badge
    Chapter 40 Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
  42. Altmetric Badge
    Chapter 41 Robust algorithms: A different approach to oracles
  43. Altmetric Badge
    Chapter 42 Node weighted matching
  44. Altmetric Badge
    Chapter 43 The propositional mu-calculus is elementary
  45. Altmetric Badge
    Chapter 44 AVL-trees for localized search
  46. Altmetric Badge
    Chapter 45 The simple roots of real-time computation hierarchies
  47. Altmetric Badge
    Chapter 46 Computational complexity of an optical disk interface
  48. Altmetric Badge
    Chapter 47 Encoding graphs by derivations and implications for the theory of graph grammars
  49. Altmetric Badge
    Chapter 48 Sampling algorithms for differential batch retrieval problems (extended abstract)
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
4 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

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
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-13345-3
ISBNs
978-3-54-013345-2, 978-3-54-038886-9
Editors

Paredaens, Jan

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 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 50%
Student > Ph. D. Student 2 50%
Readers by discipline Count As %
Computer Science 2 50%
Economics, Econometrics and Finance 1 25%
Social Sciences 1 25%