Implementation and Application of Automata : 24th International Conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019, Proceedings

This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams Front Matter ....Pages i-xvi Front Matter ....Pages 1-1 Static Garbage Collection (Sebastian Maneth)....Pages 3-9 Graph-Walking Automata: From Whence They Come, and Whither They are Bound (Alexander Okhotin)....Pages 10-29 Front Matter ....Pages 31-31 Enumerated Automata Implementation of String Dictionaries (Robert Bakarić, Damir Korenčić, Strahil Ristov)....Pages 33-44 New Approaches for Context Sensitive Flash Codes (Gilad Baruch, Shmuel T. Klein, Dana Shapira)....Pages 45-57 Dolev-Yao Theory with Associative Blindpair Operators (A. Baskar, R. Ramanujam, S. P. Suresh)....Pages 58-69 Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract) (Simon Beier, Markus Holzer)....Pages 70-82 Z-Automata for Compact and Direct Representation of Unranked Tree Languages (Johanna Björklund, Frank Drewes, Giorgio Satta)....Pages 83-94 A Benchmark Production Tool for Regular Expressions (Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti)....Pages 95-107 New Algorithms for Manipulating Sequence BDDs (Shuhei Denzumi)....Pages 108-120 A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (Akio Fujiyoshi, Daniel Průša)....Pages 121-132 Composition Closure of Linear Weighted Extended Top-Down Tree Transducers (Zoltán Fülöp, Andreas Maletti)....Pages 133-145 A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata (Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki)....Pages 146-157 Descriptional Complexity of Power and Positive Closure on Convex Languages (Michal Hospodár)....Pages 158-170 Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations (Stavros Konstantinidis, Mitja Mastnak, Juraj Šebej)....Pages 171-183 Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels (Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis)....Pages 184-196 Input-Driven Multi-counter Automata (Martin Kutrib, Andreas Malcher, Matthias Wendlandt)....Pages 197-208 Two-Dimensional Pattern Matching Against Basic Picture Languages (František Mráz, Daniel Průša, Michael Wehar)....Pages 209-221 Decision Problems for Restricted Variants of Two-Dimensional Automata (Taylor J. Smith, Kai Salomaa)....Pages 222-234 Streaming Ranked-Tree-to-String Transducers (Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano)....Pages 235-247 Back Matter ....Pages 249-249 This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms. This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.