Advertisement

Descriptional Complexity of Formal Systems

21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings

  • Michal Hospodár
  • Galina Jirásková
  • Stavros Konstantinidis
Conference proceedings DCFS 2019

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

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

Table of contents

  1. Front Matter
    Pages i-x
  2. Jarkko Kari
    Pages 35-45
  3. Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan
    Pages 86-97
  4. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 111-123
  5. Henning Fernau, Martin Vu
    Pages 124-136
  6. Daniel Gabric, Štěpán Holub, Jeffrey Shallit
    Pages 137-146
  7. Kitti Gelle, Szabolcs Iván
    Pages 147-157
  8. Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M. Stull
    Pages 171-183
  9. Galina Jirásková, Ivana Krajňáková
    Pages 184-196
  10. Lila Kari, Timothy Ng
    Pages 197-209
  11. Chris Keeler, Kai Salomaa
    Pages 210-222
  12. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
    Pages 223-234
  13. Mizuhito Ogawa, Victor Selivanov
    Pages 235-247
  14. Alexander Okhotin, Elizaveta Sazhneva
    Pages 248-259
  15. Giovanni Pighizzini, Luca Prigioniero
    Pages 260-271
  16. Back Matter
    Pages 299-299

About these proceedings

Introduction

This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019.

The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. 

Keywords

automata theory computational linguistics context free languages databases deterministic finite automata finite automata formal languages linguistics query languages regular expressions Regular language robotics robots semantics State complexity

Editors and affiliations

  • Michal Hospodár
    • 1
  • Galina Jirásková
    • 2
  • Stavros Konstantinidis
    • 3
  1. 1.Slovak Academy of SciencesKošiceSlovakia
  2. 2.Slovak Academy of SciencesKošiceSlovakia
  3. 3.Saint Mary's UniversityHalifaxCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-23247-4
  • Copyright Information IFIP International Federation for Information Processing 2019
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-030-23246-7
  • Online ISBN 978-3-030-23247-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site