↓ Skip to main content

Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 178 Construction of complete sample system for correctness testing
  3. Altmetric Badge
    Chapter 179 Ten years of speedup
  4. Altmetric Badge
    Chapter 180 On logics of discovery
  5. Altmetric Badge
    Chapter 181 On models of protection in operating systems
  6. Altmetric Badge
    Chapter 182 Parsing as a subtask of compiling
  7. Altmetric Badge
    Chapter 183 Parallel recursive program schemes
  8. Altmetric Badge
    Chapter 184 On some problems concerning Pawlak's machines
  9. Altmetric Badge
    Chapter 185 Formal power series and growth functions of Lindenmayer systems
  10. Altmetric Badge
    Chapter 186 On the representability of relations by deterministic and nondeterministic multi-tape automata
  11. Altmetric Badge
    Chapter 187 On problems solvable by successive trials
  12. Altmetric Badge
    Chapter 188 Automata and categories
  13. Altmetric Badge
    Chapter 189 On some models of computability of boolean functions
  14. Altmetric Badge
    Chapter 190 Automata and categories: Finiteness contra minimality
  15. Altmetric Badge
    Chapter 191 Languages over free groups
  16. Altmetric Badge
    Chapter 192 On the comparison of notions of approximation
  17. Altmetric Badge
    Chapter 193 Non-linear speed-up theorem for two register minsky machines
  18. Altmetric Badge
    Chapter 194 Systems of open paths in Petri nets
  19. Altmetric Badge
    Chapter 195 On the largest full sub — AFL of the full AFL of context-free languages
  20. Altmetric Badge
    Chapter 196 On complexity of nondeterministic Turing machines computations
  21. Altmetric Badge
    Chapter 197 On closure properties of context-free derivation complexity classes
  22. Altmetric Badge
    Chapter 198 Control structures in single block programs
  23. Altmetric Badge
    Chapter 199 Minimal Gödel numbers and their identification in the limit
  24. Altmetric Badge
    Chapter 200 Isomorphic representation of automata
  25. Altmetric Badge
    Chapter 201 Extended simple regular expressions
  26. Altmetric Badge
    Chapter 202 Conniver programs by logical point of view
  27. Altmetric Badge
    Chapter 203 On the set of all automata with the same monoid of endomorphisms
  28. Altmetric Badge
    Chapter 204 Nondeterministically recognizable sets of languages
  29. Altmetric Badge
    Chapter 205 The approximation problem in computational statistics
  30. Altmetric Badge
    Chapter 206 The continuous algebra of monadic languages
  31. Altmetric Badge
    Chapter 207 On sets of complex-programmed Numbers
  32. Altmetric Badge
    Chapter 208 Decision algorithms for Havel's branching automata
  33. Altmetric Badge
    Chapter 209 Automata and categories — Input processes
  34. Altmetric Badge
    Chapter 210 Formalization of algorithmic reasoning
  35. Altmetric Badge
    Chapter 211 Proving program properties, symbolic evaluation and logical procedural semantics
  36. Altmetric Badge
    Chapter 212 A contribution to error recovery
  37. Altmetric Badge
    Chapter 213 On the analysis and synthesis problems for context-free expressions
  38. Altmetric Badge
    Chapter 214 Monotone switching circuits and boolean matrix product
  39. Altmetric Badge
    Chapter 215 On some lattice-theoretic properties of generable languages
  40. Altmetric Badge
    Chapter 216 On some formal grammars generating dependency trees
  41. Altmetric Badge
    Chapter 217 Graph walking automata
  42. Altmetric Badge
    Chapter 218 On finding all solutions of the partitioning problem
  43. Altmetric Badge
    Chapter 219 Greibach normal form complexity
  44. Altmetric Badge
    Chapter 220 On correctness and essentiality of some Ianov schemas equivalence relations
  45. Altmetric Badge
    Chapter 221 Polynomially complete problems in the logic of automate discovery
  46. Altmetric Badge
    Chapter 222 Relational definition of computer languages
  47. Altmetric Badge
    Chapter 223 First-order reduction of call-by-name to call-by-value
  48. Altmetric Badge
    Chapter 224 Local disambiguating transformation
  49. Altmetric Badge
    Chapter 225 On cardinal sequential outer measures
  50. Altmetric Badge
    Chapter 226 On representation of sequential and parallel functions
  51. Altmetric Badge
    Chapter 227 The theory of the modified post algebras and multidimensional automata structures
  52. Altmetric Badge
    Chapter 228 An algebraic theory of formal languages
  53. Altmetric Badge
    Chapter 229 On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups
  54. Altmetric Badge
    Chapter 230 On the synthesis of automata with several initial states
  55. Altmetric Badge
    Chapter 231 A hierarchy of regular sequence sets
  56. Altmetric Badge
    Chapter 232 R-fuzzy grammars
  57. Altmetric Badge
    Chapter 233 Characterization of some classes of context-free languages in terms of complexity classes
  58. Altmetric Badge
    Chapter 234 Inductive inference of recursive functions
  59. Altmetric Badge
    Chapter 235 Proving properties of programs by means of predicate logic
  60. Altmetric Badge
    Chapter 236 A generalization of Scott's flow diagrams
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
2 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 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-07389-2
ISBNs
978-3-54-007389-5, 978-3-54-037585-2
Editors

Bečvář, Jíří

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 100%
Readers by discipline Count As %
Business, Management and Accounting 1 50%
Engineering 1 50%