Skip to main content
  • Conference proceedings
  • © 1984

Mathematical Foundations of Computer Science 1984

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

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

Buy it now

Buying options

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

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

Table of contents (57 papers)

  1. Front Matter

  2. A note on unique decipherability

    • Christoph M. Hoffmann
    Pages 50-63
  3. Outline of an algebraic language theory

    • Günter Hotz
    Pages 64-79
  4. Thue systems and the Church-Rosser property

    • Matthias Jantzen
    Pages 80-95
  5. Recent results on automata and infinite words

    • Dominique Perrin
    Pages 134-148
  6. VLSI algorithms and architectures

    • Franco P. Preparata
    Pages 149-161
  7. Decidability of monadic theories

    • A. L. Semenov
    Pages 162-175
  8. Sparse oracles, lowness, and highness

    • José L. Balcázar, Ronald V. Book, Uwe Schöning
    Pages 185-193
  9. Computability of probabilistic parameters for some classes of formal languages

    • Joffroy Beauquier, Loÿs Thimonier
    Pages 194-204
  10. On generalized words of Thue-Morse

    • A. ÄŒerný
    Pages 232-239

Bibliographic Information

Buy it now

Buying options

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