28th International Conference, CIAA 2024, Akita, Japan, September 3–6, 2024, Proceedings Fazekas, Szilárd Zsolt. editor. edt http://id.loc.gov/vocabulary/relators/edt SpringerLink (Online service) text sz 2024 1st ed. 2024. monographic eng

electronic

electronic resource

access XXI, 364 p. 77 illus., 19 illus. in color. online resource. This book constitutes the proceedings of the 28th International Conference on Implementation and Application of Automata, CIAA 2024, held in Akita, Japan, during September 3-6, 2024. The 24 full papers and one invited paper presented here were carefully reviewed and selected from 38 submissions. These papers have been covering various fields in the application, implementation, and theory of automata and related structures. .-Invited Talks. -- Automata and Grammars for Data Words. -- Contributed Papers. -- Computing the Bandwidth of Meager Timed Automata. -- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and other Quadratic Irrationals. -- PDFA Distillation with Error Bound Guarantees. -- Constructing a BPE Tokenization DFA. -- SAT-Based Automated Completion for Reachability Analysis. -- Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals. -- On Bidirectional Deterministic Finite Automata. -- Block Languages and their Bitmap Representations. -- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. -- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). -- Global One-Counter Tree Automata. -- Decision Problems for Subregular Classes. -- State Complexity of the Minimal Star Basis. -- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. -- Attributed Tree Transducers for Partial Functions. -- Translation of Semi-Extended Regular Expressions using Derivatives. -- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. -- Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata. -- The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable. -- Push Complexity: Optimal Bounds and Unary Inputs. -- Decision Problems for Reversible and Permutation Automata. -- Benchmarking Regular Expression Matching. -- On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. -- Measuring Power of Commutative Group Languages. edited by Szilárd Zsolt Fazekas. Computer science Artificial intelligence Information storage and retrieval systems Algorithms Computer science Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Artificial Intelligence Information Storage and Retrieval Algorithms Discrete Mathematics in Computer Science QA75.5-76.95 9783031711121 https://doi.org/10.1007/978-3-031-71112-1 https://doi.org/10.1007/978-3-031-71112-1 240903 20251030112936.0 978-3-031-71112-1