[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Mathematical Foundations of Computer Science 1984

11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings

  • Conference proceedings
  • © 1984

Overview

Editors:
  1. M. P. Chytil
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. V. Koubek
    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 176)

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

Keywords

Table of contents (57 papers)

  1. Front Matter

    Download chapter PDF

  2. Separating, strongly separating, and collapsing relativized complexity classes

    • José Luis Balcázar
    Pages 1-16

  3. Complexity of quantifier elimination in the theory of algebraically closed fields

    • A. L. Chistov, D. Yu. Grigor'ev
    Pages 17-31

  4. Systolic automata — power, characterizations, nonhomogeneity

    • Jozef Gruska
    Pages 32-49

  5. A note on unique decipherability

    • Christoph M. Hoffmann
    Pages 50-63

  6. Outline of an algebraic language theory

    • Günter Hotz
    Pages 64-79

  7. Thue systems and the Church-Rosser property

    • Matthias Jantzen
    Pages 80-95

  8. Limits, higher type computability and type-free languages

    • G. Longo
    Pages 96-114

  9. Traces, histories, graphs: Instances of a process monoid

    • Antoni Mazurkiewicz
    Pages 115-133

  10. Recent results on automata and infinite words

    • Dominique Perrin
    Pages 134-148

  11. VLSI algorithms and architectures

    • Franco P. Preparata
    Pages 149-161

  12. Decidability of monadic theories

    • A. L. Semenov
    Pages 162-175

  13. On the Ehrenfeucht conjecture on test sets and its dual version

    • J. Albert
    Pages 176-184

  14. Sparse oracles, lowness, and highness

    • José L. Balcázar, Ronald V. Book, Uwe Schöning
    Pages 185-193

  15. Computability of probabilistic parameters for some classes of formal languages

    • Joffroy Beauquier, Loÿs Thimonier
    Pages 194-204

  16. A truely morphic characterization of recursively enumerable sets

    • Franz Josef Brandenburg
    Pages 205-213

  17. On the Herbrand Kleene universe for nondeterministic computations

    • Manfred Broy
    Pages 214-222

  18. An investigation of controls for concurrent systems by abstract control languages

    • H. D. Burkhard
    Pages 223-231

  19. On generalized words of Thue-Morse

    • A. ÄŒerný
    Pages 232-239

  20. Nondeterminism is essential for two-way counter machines

    • Marek Chrobak
    Pages 240-244
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top