04675nam a22006135i 4500 978-3-031-71112-1 DE-He213 20251030112936.0 cr nn 008mamaa 240903s2024 sz | s |||| 0|eng d 9783031711121 978-3-031-71112-1 10.1007/978-3-031-71112-1 doi QA75.5-76.95 UYA bicssc COM014000 bisacsh UYA thema Implementation and Application of Automata [electronic resource] : 28th International Conference, CIAA 2024, Akita, Japan, September 3–6, 2024, Proceedings / edited by Szilárd Zsolt Fazekas. 1st ed. 2024. Cham : Springer Nature Switzerland : Imprint: Springer, 2024. XXI, 364 p. 77 illus., 19 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Lecture Notes in Computer Science, 1611-3349 ; 15015 .-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. 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. Computer science. 58552 Artificial intelligence. 58441 Information storage and retrieval systems. 65568 Algorithms. 58677 Computer science Mathematics. 64041 Discrete mathematics. Theory of Computation. 67552 Computer Science Logic and Foundations of Programming. 68173 Artificial Intelligence. 58441 Information Storage and Retrieval. 65570 Algorithms. 58677 Discrete Mathematics in Computer Science. Fazekas, Szilárd Zsolt. editor. (orcid)0000-0001-5319-0395 https://orcid.org/0000-0001-5319-0395 edt http://id.loc.gov/vocabulary/relators/edt 83645 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031711114 Printed edition: 9783031711138 Lecture Notes in Computer Science, 1611-3349 ; 15015 https://doi.org/10.1007/978-3-031-71112-1 ZDB-2-SCS ZDB-2-SXCS ZDB-2-LNC 63079 63079