Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 1974

3rd Symposium at Jadwisin near Warsaw, June 17 - 22, 1974

  • Conference proceedings
  • © 1975

Overview

Editors:
  1. A. Blikle
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 28)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Sequential functions and generalized Moore and Mealy automata

    • Jiří Bečvář
    Pages 1-8

  3. Mathematical methods of the theory of stochastic automata

    • A. Bertoni
    Pages 9-22

  4. On the quasi-controllability of automata

    • L. Beyga
    Pages 23-25

  5. Models for analysis of races in sequential networks

    • J. A. Brzozowski, M. Yoeli
    Pages 26-32

  6. Factorizations, congruences, and the decomposition of automata and systems

    • J. A. Goguen, J. W. Thatcher, E. G. Wagner, J. B. Wright
    Pages 33-45

  7. On the periodic sum and extensions of finite automata

    • Jerzy W. Grzymala-Busse
    Pages 46-52

  8. Finite branching automata: automata theory motivated by problem solving

    • Ivan M. Havel
    Pages 53-61

  9. On configurations in cellular automata

    • Peter Mikulecký
    Pages 62-68

  10. Finite automata acceptation of infinite sequences

    • K. Wagner, L. Staiger
    Pages 69-72

  11. R-fuzzy automata with a time-variant structure

    • W. Wechler
    Pages 73-76

  12. Functions computable in the limit by probabilistic machines

    • R. V. Freivald
    Pages 77-87

  13. Some properties of limit recursive functions

    • B. Goetze, R. Klette
    Pages 88-90

  14. On some approximation problems of continuous computation

    • B. Konikowska
    Pages 91-106

  15. Set-theoretic properties of programs in stored program computers

    • W. Kwasowiec
    Pages 107-113

  16. Classification of programs of a SPC

    • Z. Raś
    Pages 114-125

  17. The algebraic approach to the theory of computing systems

    • Jerzy Tiuryn
    Pages 126-142

  18. Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables

    • W. Żakowski
    Pages 143-156

  19. An approach to correctness proofs of semicoroutines

    • Ole-Johan Dahl
    Pages 157-174

  20. Towards an understanding of complex processes

    • P. Dembiński
    Pages 175-185
Back to top

Keywords

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1974

  • Book Subtitle: 3rd Symposium at Jadwisin near Warsaw, June 17 - 22, 1974

  • Editors: A. Blikle

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-07162-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1975

  • Softcover ISBN: 978-3-540-07162-4Published: 02 May 1975

  • eBook ISBN: 978-3-540-37492-3Published: 17 September 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VII, 485

  • Topics: Theory of Computation, Computer Science, general

Publish with us

Policies and ethics

Back to top

Search

Navigation