Cantitate/Preț
Produs
Total produse
Vezi coșul
Implementation and Application of Automata de Benedek Nagy

Implementation and Application of Automata

Editat de Benedek Nagy
en Limba Engleză Paperback – 10 aug 2023
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.
Citește tot Restrânge

Preț: 40404 lei

Preț vechi: 50505 lei
-20% Nou

Puncte Express: 606
Preț estimativ în valută:
7148€ • 8341$ • 6250£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031402463
ISBN-10: 3031402464
Pagini: 316
Ilustrații: XII, 304 p. 81 illus., 16 illus. in color.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1st edition 2023
Editura: Springer
Locul publicării:Cham, Switzerland

Cuprins

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.