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

Implementation and Application of Automata: Lecture Notes in Computer Science

Editat de Pascal Caron, Ludovic Mignot
en Limba Engleză Paperback – 28 mai 2022
This book constitutes the proceedings of the 26th International Conference on Implementation and Application of Automata, CIAA 2022, held in Rouen, France in June/ July 2022. The 16 regular papers presented together with 3 invited lectures in this book were carefully reviewed and selected from 26 submissions. The topics of the papers covering various fields in the application, implementation, and theory of automata and related structures.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40140 lei

Preț vechi: 50174 lei
-20% Nou

Puncte Express: 602
Preț estimativ în valută:
7104€ • 8331$ • 6229£

Carte tipărită la comandă

Livrare economică 24 ianuarie-07 februarie 26

 Adaugă în coș

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

Specificații

ISBN-13: 9783031074684
ISBN-10: 3031074688
Pagini: 264
Ilustrații: X, 251 p. 62 illus., 17 illus. in color.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

​On 25 Years of CIAA Through the Lens of Data Science.- Manipulation of Regular Expressions Using Derivatives: an Overview.- How to Settle the ReDoS Problem: Back to the Classical Automata Theory.- Ordered Context-Free Grammars.- Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.- A Similarity Measure for Formal Languages Based on Convergent Geometric Series.- Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata.- Some results concerning careful synchronization of partial automata and subset synchronization of DFA’s.- A Toolkit for Parikh Matrices.- Syntax Checking Either Way.- On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata.- The Cut Operation in Subclasses of Convex Languages (Extended Abstract).- Variations of the Separating Words Problem.- Homomorphisms on graph-walking automata.- Nondeterministic State Complexity of Site-Directed Deletion.- Energy Complexity of Regular Language Recognition.-Real-Time, Constant-Space, Constant-Randomness Verifiers.- Constrained Synchronization for Monotonic, Solvable and Automata with Simple Idempotents.- An Ambiguity Hierarchy of Weighted Context-free Grammars.