Welcome to the Library Catalog of "Dunarea de Jos" University of Galati

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.

Contributor(s): Material type: TextSeries: Lecture Notes in Computer Science ; 15015Publisher: Cham : Springer Nature Switzerland : Imprint: Springer, 2024Edition: 1st ed. 2024Description: XXI, 364 p. 77 illus., 19 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783031711121
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleLOC classification:
  • QA75.5-76.95
Online resources:
Contents:
.-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.
In: Springer Nature eBookSummary: 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.
Item type: List(s) this item appears in: Titluri cărți electronice Springer Nature 2025 (10631 titluri)
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

.-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.

There are no comments on this title.

to post a comment.
Biblioteca Universității "Dunărea de Jos" din Galați