04479nam a22005655i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001700172072001600189072002300205072001500228245020200243250001800445264006900463300006500532336002600597337002600623338003600649347002400685490005900709505179500768520043102563650002902994650003603023650005403059650002303113650004203136650002603178650003403204650006603238650003603304650004603340650002303386650004603409700016103455710003403616773002603650776003603676776003603712830005903748856004603807912001403853912001503867912001403882999001703896978-3-031-71112-1DE-He21320251030112936.0cr nn 008mamaa240903s2024    sz |    s    |||| 0|eng d  a97830317111219978-3-031-71112-17 a10.1007/978-3-031-71112-12doi 4aQA75.5-76.95 7aUYA2bicssc 7aCOM0140002bisacsh 7aUYA2thema10aImplementation and Application of Automatah[electronic resource] :b28th International Conference, CIAA 2024, Akita, Japan, September 3–6, 2024, Proceedings /cedited by Szilárd Zsolt Fazekas.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXXI, 364 p. 77 illus., 19 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aLecture Notes in Computer Science,x1611-3349 ;v150150 a.-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.  aThis 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. 0aComputer science.958552 0aArtificial intelligence.958441 0aInformation storage and retrieval systems.965568 0aAlgorithms.958677 0aComputer sciencexMathematics.964041 0aDiscrete mathematics.14aTheory of Computation.96755224aComputer Science Logic and Foundations of Programming.96817324aArtificial Intelligence.95844124aInformation Storage and Retrieval.96557024aAlgorithms.95867724aDiscrete Mathematics in Computer Science.1 aFazekas, Szilárd Zsolt.eeditor.0(orcid)0000-0001-5319-03951https://orcid.org/0000-0001-5319-03954edt4http://id.loc.gov/vocabulary/relators/edt9836452 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303171111408iPrinted edition:z9783031711138 0aLecture Notes in Computer Science,x1611-3349 ;v1501540uhttps://doi.org/10.1007/978-3-031-71112-1  aZDB-2-SCS  aZDB-2-SXCS  aZDB-2-LNC  c63079d63079