Fundamentals of Computation Theory

16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Proceedings

  • Editors
  • Erzsébet Csuhaj-Varjú
  • Zoltán Ésik
Conference proceedings FCT 2007

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

Table of contents

  1. Front Matter
    PDF

  2. Invited Lectures

    1. Rewriting Systems with Data
      Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu
      Pages 1-22
    2. Spiking Neural P Systems: Some Characterizations
      Oscar H. Ibarra, Sara Woodworth
      Pages 23-37
    3. Approximating Graphs by Graphs and Functions (Abstract)
      László Lovász
      Pages 38-38
    4. Traces, Feedback, and the Geometry of Computation (Abstract)
      Philip J. Scott
      Pages 39-39

  3. Contributions

    1. A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings
      Abdullah N. Arslan
      Pages 40-51
    2. Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
      Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
      Pages 52-63
    3. A Novel Information Transmission Problem and Its Optimal Solution
      Eric Bach, Jin-Yi Cai
      Pages 64-75
    4. Local Testing of Message Sequence Charts Is Difficult
      Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
      Pages 76-87
    5. On Notions of Regularity for Data Languages
      Henrik Björklund, Thomas Schwentick
      Pages 88-99
    6. FJMIP: A Calculus for a Modular Object Initialization
      Viviana Bono, Jarosław D. M. Kuśmierek
      Pages 100-112
    7. Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
      Henning Bordihn, György Vaszil
      Pages 113-124
    8. The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
      Hans-Georg Breunig
      Pages 125-136
    9. Pattern Matching in Protein-Protein Interaction Graphs
      Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
      Pages 137-148
    10. From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates
      Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
      Pages 149-160
    11. A String-Based Model for Simple Gene Assembly
      Robert Brijder, Miika Langille, Ion Petre
      Pages 161-172
    12. On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation
      Nadia Busi, Claudio Zandron
      Pages 173-186
    13. On Block-Wise Symmetric Signatures for Matchgates
      Jin-Yi Cai, Pinyan Lu
      Pages 187-198
    14. Path Algorithms on Regular Graphs
      Didier Caucal, Dinh Trong Hieu
      Pages 199-212
    15. Factorization of Fuzzy Automata
      Miroslav Ćirić, Aleksandar Stamenković, Jelena Ignjatović, Tatjana Petković
      Pages 213-225

About these proceedings

Keywords

Automat algorithm algorithms automata complexity computational geometry computer computer science distributed systems formal language formal languages logic semantics verification

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-74240-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-74239-5
  • Online ISBN 978-3-540-74240-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site