Descriptional Complexity of Formal Systems

18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings

  • Cezar Câmpeanu
  • Florin Manea
  • Jeffrey Shallit

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9777)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Eugenija A. Bondar, Mikhail V. Volkov
    Pages 1-17
  3. Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
    Pages 45-59
  4. Janusz Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykuła
    Pages 73-86
  5. Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian
    Pages 98-110
  6. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 111-125
  7. Lukas Fleischer, Manfred Kufleitner
    Pages 126-137
  8. Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
    Pages 138-152
  9. Galina Jirásková, Alexander Szabari, Juraj Šebej
    Pages 153-167
  10. Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
    Pages 168-179
  11. Laurette Marais, Lynette van Zijl
    Pages 180-191
  12. Timothy Ng, David Rappaport, Kai Salomaa
    Pages 192-204
  13. Vojtěch Vorel
    Pages 205-216
  14. Back Matter
    Pages 217-217

About these proceedings

Introduction

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions.
Descriptional Complexity is a field in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, finte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. 

Keywords

automata theory context free languages formal languages regular languages turing machines automata extensions computational completeness descriptional complexity measures deterministic finite automaton grammars graph-controlled systems information theory insertion-deletion systems models of computation quantitative automata quantum complexity theory state complexity syntactic complexity theory of computation unrestricted complexity

Editors and affiliations

  • Cezar Câmpeanu
    • 1
  • Florin Manea
    • 2
  • Jeffrey Shallit
    • 3
  1. 1.University of Prince Edward IslandCharlottetownCanada
  2. 2.Universität KielKielGermany
  3. 3.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-41114-9
  • Copyright Information IFIP International Federation for Information Processing 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-41113-2
  • Online ISBN 978-3-319-41114-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book