On the Power of Generalized Forbidding Insertion-Deletion Systems
We consider generalized forbidding insertion-deletion systems (GFID) where each insertion-deletion rule is associated with a set \(\mathcal {F}\) of words and the rule can be applied to a string only if every word of \(\mathcal {F}\) is not a subword of t
- PDF / 5,900,667 Bytes
- 255 Pages / 439.37 x 666.142 pts Page_size
- 80 Downloads / 165 Views
Galina Jirásková Giovanni Pighizzini (Eds.)
Descriptional Complexity of Formal Systems 22nd International Conference, DCFS 2020 Vienna, Austria, August 24–26, 2020 Proceedings
Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA
Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA
12442
More information about this series at http://www.springer.com/series/7407
Galina Jirásková Giovanni Pighizzini (Eds.) •
Descriptional Complexity of Formal Systems 22nd International Conference, DCFS 2020 Vienna, Austria, August 24–26, 2020 Proceedings
123
Editors Galina Jirásková Slovak Academy of Sciences Košice, Slovakia
Giovanni Pighizzini University of Milan Milan, Italy
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-62535-1 ISBN 978-3-030-62536-8 (eBook) https://doi.org/10.1007/978-3-030-62536-8 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
The 22nd International Conference on Descriptional Complexity of Formal Systems (DCFS 2020) was expected to be organized by Rudolf Freund at the TU Wien as part of the Summer of Formal Languages 2020 in Wien, Austria, and by the International Federation for Information Processing (IFIP) Working Group 1.02 “Descriptional Complexity.” Unfortunately, due to deve
Data Loading...
