Skip to main content
SpringerLink
Log in

Descriptional Complexity of Formal Systems

19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Giovanni Pighizzini

    1. Università degli Studi di Milano, Milan, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Cezar Câmpeanu

    1. University of Prince Edward Island, Charlottetown, Canada

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

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

Included in the following conference series:

Conference proceedings info: DCFS 2017.

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

  1. Contributed Papers

    1. A Pumping Lemma for Ordered Restarting Automata

      • Kent Kwee, Friedrich Otto
      Pages 226-237

    2. Concise Representations of Reversible Automata

      • Giovanna J. Lavado, Luca Prigioniero
      Pages 238-249

    3. State Complexity of Unary SV-XNFA with Different Acceptance Conditions

      • Laurette Marais, Lynette van Zijl
      Pages 250-261

    4. Reset Complexity of Ideal Languages Over a Binary Alphabet

      • Marina Maslennikova
      Pages 262-273

    5. 2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets

      • Turlough Neary
      Pages 274-286

    6. State Complexity of Suffix Distance

      • Timothy Ng, David Rappaport, Kai Salomaa
      Pages 287-298

    7. The Quotient Operation on Input-Driven Pushdown Automata

      • Alexander Okhotin, Kai Salomaa
      Pages 299-310

  2. Back Matter

    Pages 311-311
    Download chapter PDF
Back to top

Other volumes

  1. Descriptional Complexity of Formal Systems

Keywords

About this book

This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

Editors and Affiliations

  • Università degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

  • University of Prince Edward Island, Charlottetown, Canada

    Cezar Câmpeanu

Bibliographic Information

Publish with us

Policies and ethics

Societies and partnerships

Back to top

Search

Navigation