↓ Skip to main content

Mathematical Foundations of Computer Science 1976

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 157 Exercises in denotational semantics
  3. Altmetric Badge
    Chapter 158 W-automata and their languages
  4. Altmetric Badge
    Chapter 159 On semantic issues in the relational model of data
  5. Altmetric Badge
    Chapter 160 The effective arrangement of logical systems
  6. Altmetric Badge
    Chapter 161 Recursivity, sequence recursivity, stack recursivity and semantics of programs
  7. Altmetric Badge
    Chapter 162 Descriptional complexity (of languages) a short survey
  8. Altmetric Badge
    Chapter 163 On the branching structure of languages
  9. Altmetric Badge
    Chapter 164 Algorithms and real numbers
  10. Altmetric Badge
    Chapter 165 On mappings of machines
  11. Altmetric Badge
    Chapter 166 Recent results on L systems
  12. Altmetric Badge
    Chapter 167 Decision problems for multi-tape automata
  13. Altmetric Badge
    Chapter 168 Recursive program schemes and computable functionals
  14. Altmetric Badge
    Chapter 169 Some fundamentals of order-algebraic semantics
  15. Altmetric Badge
    Chapter 170 On attribute grammars
  16. Altmetric Badge
    Chapter 171 Formal definition of semantics of generalized control regimes
  17. Altmetric Badge
    Chapter 172 Minimal while programs
  18. Altmetric Badge
    Chapter 173 On specific features of recognizable families of languages
  19. Altmetric Badge
    Chapter 174 On the termination of simple computer programs
  20. Altmetric Badge
    Chapter 175 Reduction of Petri-nets
  21. Altmetric Badge
    Chapter 176 On behaviour of R-fuzzy automata
  22. Altmetric Badge
    Chapter 177 Cannonizing reducibility method in the theory of program schemata
  23. Altmetric Badge
    Chapter 178 Strongly connected G-S-M mappings preserving conjugation
  24. Altmetric Badge
    Chapter 179 Analysis of the non-context-free component of formal languages
  25. Altmetric Badge
    Chapter 180 Programs, computations and temporal features
  26. Altmetric Badge
    Chapter 181 A note on the automatic generation of inductive assertions
  27. Altmetric Badge
    Chapter 182 On the relationship between a procedure and its data
  28. Altmetric Badge
    Chapter 183 On the relativization of deterministic and nondeterministic complexity classes
  29. Altmetric Badge
    Chapter 184 The metric properties on the semigroups and the languages
  30. Altmetric Badge
    Chapter 185 A lower bound of 1/2n2 on linear search programs for the knapsack problem
  31. Altmetric Badge
    Chapter 186 The direct product of automata and quasi-automata
  32. Altmetric Badge
    Chapter 187 An axiomatic approach to information structures
  33. Altmetric Badge
    Chapter 188 Parallelism of manipulations in multidimensional information structures
  34. Altmetric Badge
    Chapter 189 On strict interpretations of grammar forms
  35. Altmetric Badge
    Chapter 190 A hierarchy of context-sensitive languages
  36. Altmetric Badge
    Chapter 191 On consecutive storage of records
  37. Altmetric Badge
    Chapter 192 A remark on equivalence of Mazurkiewicz's finite — control algorithms over nets
  38. Altmetric Badge
    Chapter 193 Microprogram — Oriented model of the controlled structure
  39. Altmetric Badge
    Chapter 194 Relations between programs with different storage requirements
  40. Altmetric Badge
    Chapter 195 An algebraic approach to data types, program verification, and program synthesis
  41. Altmetric Badge
    Chapter 196 About three equational classes of languages built up by shuffle operations
  42. Altmetric Badge
    Chapter 197 A machine independent description of complexity classes, definable by nondeterministic as well as deterministic turing machines with primitiv recursive tape or time bounds
  43. Altmetric Badge
    Chapter 198 Schemes with recursion on higher types
  44. Altmetric Badge
    Chapter 199 Constructing iterative version of a system of recursive procedures
  45. Altmetric Badge
    Chapter 200 A method using a set-theoretical formalism to describe the semantics of programming languages
  46. Altmetric Badge
    Chapter 201 The cubic search method
  47. Altmetric Badge
    Chapter 202 Vectors of coroutines
  48. Altmetric Badge
    Chapter 203 One — one degrees of Turing machines decision problems
  49. Altmetric Badge
    Chapter 204 Heuristic representation of state-space by finite automaton
  50. Altmetric Badge
    Chapter 205 Semigroup characterizations of some language varieties
  51. Altmetric Badge
    Chapter 206 On memory requirements of Strassen's algorithms
  52. Altmetric Badge
    Chapter 207 Determinism in concurrent systems
  53. Altmetric Badge
    Chapter 208 Generating control mechanisms by restrictions
  54. Altmetric Badge
    Chapter 209 On diagnosis of algorithmical processes
  55. Altmetric Badge
    Chapter 210 On some properties of cyclic automata and their extensions
  56. Altmetric Badge
    Chapter 211 Compiler generation using denotational semantics
  57. Altmetric Badge
    Chapter 212 On divergence problem for program schemas
  58. Altmetric Badge
    Chapter 213 On the parsing of LL-regular grammars
  59. Altmetric Badge
    Chapter 214 The characteristic polynomial of a finite automaton
  60. Altmetric Badge
    Chapter 215 Error detection using regular languages
  61. Altmetric Badge
    Chapter 216 On a relationship between programs of address machines and Mazurkiewicz algorithms
  62. Altmetric Badge
    Chapter 217 DIJKSTRA's predicate transformer, non-determinism, recursion, and termination
  63. Altmetric Badge
    Chapter 218 Context-free programmed grammars and ETOL systems
  64. Altmetric Badge
    Chapter 219 Context-free algebra: A mathematical device for compiler specification
  65. Altmetric Badge
    Chapter 220 On the lower bound for minimum comparison selection
  66. Altmetric Badge
    Chapter 221 Computational processes generated by programs with /recursive/ procedures and block structures
  67. Altmetric Badge
    Chapter 222 An algebraic framework for the study of the syntactic monoids application to the group languages
  68. Altmetric Badge
    Chapter 223 Degrees of parallelism in computations
  69. Altmetric Badge
    Chapter 224 On adaptability of a system of programs
  70. Altmetric Badge
    Chapter 225 A mathematical model of parallel information processing
  71. Altmetric Badge
    Chapter 226 Powerdomains
  72. Altmetric Badge
    Chapter 227 On the domain of iteration in iterative algebraic theories
  73. Altmetric Badge
    Chapter 228 The influence of the data presentation on the computational power of machines
  74. Altmetric Badge
    Chapter 229 On sequential modelling of non-sequential processes
  75. Altmetric Badge
    Chapter 230 Equivalence and optimization of recursive program schemata
  76. Altmetric Badge
    Chapter 231 Observability concepts in abstract data type specification
  77. Altmetric Badge
    Chapter 232 The calculus of facts
  78. Altmetric Badge
    Chapter 233 Multiplicity functions on ω-automata
  79. Altmetric Badge
    Chapter 234 A complete axiomatic characterization of algorithmic properties of block-structured programs with procedures
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 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 1976
Published by
Springer Berlin Heidelberg, January 1976
DOI 10.1007/3-540-07854-1
ISBNs
978-3-54-007854-8, 978-3-54-038169-3
Editors

Antoni Mazurkiewicz

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 %
Switzerland 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Unspecified 4 133%
Student > Bachelor 2 67%
Student > Doctoral Student 2 67%
Student > Ph. D. Student 1 33%
Librarian 1 33%
Other 1 33%
Readers by discipline Count As %
Unspecified 4 133%
Computer Science 3 100%
Medicine and Dentistry 2 67%
Engineering 2 67%