صورة الغلاف

Implementation and Application of Automata 28th International Conference, CIAA 2024, Akita, Japan, September 3–6, 2024, Proceedings /

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

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
مؤلف مشترك: SpringerLink (Online service)
مؤلفون آخرون: Fazekas, Szilárd Zsolt (المحرر)
التنسيق: الكتروني كتاب الكتروني
اللغة:الإنجليزية
منشور في: Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
الطبعة:1st ed. 2024.
سلاسل:Lecture Notes in Computer Science, 15015
الموضوعات:
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.
Discrete Mathematics in Computer Science.
الوصول للمادة أونلاين:https://doi.org/10.1007/978-3-031-71112-1
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
جدول المحتويات:
  • .-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.

مواد مشابهة