Static Garbage Collection -- Graph-Walking Automata: From Whence They Come, and Whither They Are Bound -- Enumerated Automata Implementation of String Dictionaries -- New Approaches for Context Sensitive Flash Codes -- Dolev-Yao Theory with Associative Blindpair Operators: An Automata-Theoretic Approach -- Semi-Linear Lattices and Right One-Way Jumping Finite Automata -- Z-Automata for Compact and Direct Representation of Unranked Tree Languages -- A Benchmark Production Tool for Regular Expressions -- New Algorithms for Manipulating Sequence BDDs -- A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs -- Composition Closure of Linear Weighted Extended Top-Down Tree Transducers -- A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata -- Descriptional Complexity of Power and Positive Closure on Convex Languages -- Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations -- Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels -- Input-Driven Multi-Counter Automata -- Two-Dimensional Pattern Matching against Basic Picture Languages -- Decision Problems for Restricted Variants of Two-Dimensional Automata -- Streaming Ranked-Tree-to-String Transducers. .

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.