Skip to main content
SpringerLink
Log in

Fundamentals of Computation Theory

20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Adrian Kosowski

    1. Université Paris Diderot, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Walukiewicz

    1. Université Bordeaux 1, Talence, France

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: FCT 2015.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  3. Geometry, Combinatorics, Text Algorithms

    1. Front Matter

      Pages 25-25
      Download chapter PDF

    2. Longest \(\alpha \)-Gapped Repeat and Palindrome

      • Paweł Gawrychowski, Florin Manea
      Pages 27-40

    3. On the Enumeration of Permutominoes

      • Ana Paula Tomás
      Pages 41-52

    4. Stabbing Segments with Rectilinear Objects

      • Mercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira
      Pages 53-64

    5. \(\beta \)-skeletons for a Set of Line Segments in \(R^2 \)

      • Mirosław Kowaluk, Gabriela Majewska
      Pages 65-78

  4. Complexity and Boolean Functions

    1. Front Matter

      Pages 79-79
      Download chapter PDF

    2. Depth, Highness and DNR Degrees

      • Philippe Moser, Frank Stephan
      Pages 81-94

    3. On the Expressive Power of Read-Once Determinants

      • N. R. Aravind, Pushkar S. Joglekar
      Pages 95-105

    4. Constructive Relationships Between Algebraic Thickness and Normality

      • Joan Boyar, Magnus Gausdal Find
      Pages 106-117

    5. On the Structure of Solution-Graphs for Boolean Formulas

      • Patrick Scharpfenecker
      Pages 118-130

  5. Languages

    1. Front Matter

      Pages 131-131
      Download chapter PDF

    2. Interprocedural Reachability for Flat Integer Programs

      • Pierre Ganty, Radu Iosif
      Pages 133-145

    3. Complexity of Suffix-Free Regular Languages

      • Janusz Brzozowski, Marek Szykuła
      Pages 146-159

    4. Alternation Hierarchies of First Order Logic with Regular Predicates

      • Luc Dartois, Charles Paperman
      Pages 160-172

    5. A Note on Decidable Separability by Piecewise Testable Languages

      • Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
      Pages 173-185

  6. Set Algorithms, Covering, and Traversal

    1. Front Matter

      Pages 187-187
      Download chapter PDF
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games.

Editors and Affiliations

  • Université Paris Diderot, Paris, France

    Adrian Kosowski

  • Université Bordeaux 1, Talence, France

    Igor Walukiewicz

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation