Del 14151 - Lecture Notes in Computer Science

Implementation and Application of Automata

27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023, Proceedings

Häftad, Engelska, 2023

Av Benedek Nagy

919 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19–22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.

Produktinformation

Utgivningsdatum2023-08-10
Mått155 x 235 x 18 mm
Vikt482 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor304
FörlagSpringer International Publishing AG
ISBN9783031402463

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Artificiell intelligens inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

Finite automata as verifiers.- Binary Coded Unary Regular Languages.- A Survey on Automata with Translucent Letters.- Earliest Query Answering for Deterministic Stepwise Hedge Automata.- Constrained Multi-Tildes.- On the smallest synchronizing terms of finite tree automata.- Universal First-Order Quantification over Automata.- Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.- Sweep complexity revisited.- The Pumping Lemma for Regular Languages is Hard.- M-equivalence of Parikh Matrix over a Ternary Alphabet.- Operational Complexity in Subregular Classes.- When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem.- Enhanced Ternary Fibonacci Codes.- Sweeping Input-Driven Pushdown Automata.- Verified Verifying: SMT-LIB for Strings in Isabelle.- Weighted Bottom-up and Top-down Tree Transformations Are Incomparable.- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer.- A time to cast away stones.- Two-way Machines and de Bruijn Words.- Transduction of Automatic Sequences and Applications.- Measuring Power of Generalised Definite Languages.- Smaller Representation of Compiled Regular Expressions.