Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2003

Fundamentals of Computation Theory

14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings

Editors:

  1. Andrzej Lingas

    1. Department of Computer Science, Lund University, Lund, Sweden

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bengt J. Nilsson

    1. School of Technology and Society, Malmö University, Malmö, Sweden

    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 2751)

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

Conference proceedings info: FCT 2003.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (39 papers)

  1. Computational Biology

    1. Complexity of Approximating Closest Substring Problems

      • Patricia A. Evans, Andrew D. Smith
      Pages 210-221

  2. Computational Geometry

    2. Competitive Exploration of Rectilinear Polygons

      • Mikael Hammar, Bengt J. Nilsson, Mia Persson
      Pages 234-245

    3. An Improved Approximation Algorithm for Computing Geometric Shortest Paths

      • Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
      Pages 246-257

    5. On Boundaries of Highly Visible Spaces and Applications

      • John H. Reif, Zheng Sun
      Pages 271-283

  3. Computational Models and Complexity

    1. Membrane Computing

      • Gheorghe Păun
      Pages 284-295

    2. Classical Simulation Complexity of Quantum Machines

      • Farid Ablayev, Aida Gainutdinova
      Pages 296-302

    3. Using Depth to Capture Average-Case Complexity

      • Luís Antunes, Lance Fortnow, N. V. Vinodchandran
      Pages 303-310

  4. Structural Complexity

    1. Non-uniform Depth of Polynomial Time and Space Simulations

      • Richard J. Lipton, Anastasios Viglas
      Pages 311-320

  5. Formal Languages

    1. Operations Preserving Recognizable Languages

      • Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Éric Pin
      Pages 343-354

    2. Languages Defined by Generalized Equality Sets

      • Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
      Pages 355-363

    3. Context-Sensitive Equivalences for Non-interference Based Protocol Analysis

      • Michele Bugliesi, Ambra Ceccato, Sabina Rossi
      Pages 364-375

    4. On the Exponentiation of Languages

      • Werner Kuich, Klaus W. Wagner
      Pages 376-386

    5. Kleene’s Theorem for Weighted Tree-Automata

      • Christian Pech
      Pages 387-399
Back to top

Other Volumes

  1. Fundamentals of Computation Theory

Back to top

Keywords

Back to top

Editors and Affiliations

  • Department of Computer Science, Lund University, Lund, Sweden

    Andrzej Lingas

  • School of Technology and Society, Malmö University, Malmö, Sweden

    Bengt J. Nilsson

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Search

Navigation