Skip to main content
  • Conference proceedings
  • © 1997

Fundamentals of Computation Theory

11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings

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

Conference series link(s): FCT: International Symposium on Fundamentals of Computation Theory

Conference proceedings info: FCT 1997.

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 (40 papers)

  1. Pattern-matching problems for 2-dimensional images described by finite automata

    • Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Pages 245-256
  2. Contextual grammars with distributed catenation and shuffle

    • Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
    Pages 269-280
  3. Synchronization of 1-way connected processors

    • Salvatore La Torre, Margherita Napoli, Mimmo Parente
    Pages 293-304
  4. A linear-time heuristic for minimum rectangular coverings (Extended abstract)

    • Christos Levcopoulos, Joachim Gudmundsson
    Pages 305-316
  5. Cellular automata universality revisited

    • Bruno Martin
    Pages 329-339
  6. Trade-off results for connection management

    • Marios Mavronicolas, Nikos Papadakis
    Pages 340-351
  7. Towards optimal locality in mesh-indexings

    • Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
    Pages 364-375
  8. On the hierarchy of nondeterministic branching k-programs

    • Elizaveta A. Okol'nishnikova
    Pages 376-387
  9. FDT is undecidable for finitely presented monoids with solvable word problems

    • Friedrich Otto, Andrea Sattler-Klein
    Pages 388-399
  10. From finite automata toward hybrid systems (Extended abstract)

    • A. Rabinovich, B. A. Trakhtenbrot
    Pages 411-422
  11. The complexity of universal text-learners

    • Frank C. Stephan, Sebastiaan A. Terwijn
    Pages 441-451

Other Volumes

  1. Fundamentals of Computation Theory

About this book

This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997.
The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc.

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