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

Implementation and Application of Automata: Lecture Notes in Computer Science, cartea 12803

Editat de Sebastian Maneth
en Limba Engleză Paperback – 23 iun 2021
This book constitutes the proceedings of the 25th International Conference on Implementation and Application of Automata, CIAA 2021, held in July 2021. Due to Covid-19 pandemic the conference was held virtually. The 13 regular papers presented in this book were carefully reviewed and selected from 20 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

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 31747 lei  6-8 săpt.
  Springer – 23 iun 2021 31747 lei  6-8 săpt.
  Springer – 24 iun 2009 32093 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 31747 lei

Preț vechi: 39684 lei
-20%

Puncte Express: 476
Preț estimativ în valută:
5613€ • 6487$ • 4850£

Carte tipărită la comandă

Livrare economică 04-18 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030791209
ISBN-10: 3030791203
Pagini: 208
Ilustrații: XIII, 191 p. 25 illus., 7 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.32 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Polyregular Functions.- Back to the Future: A Fresh Look at Linear Temporal Logic.- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.- Memoized Regular Expressions.- The Commutative Closure of Shuffle Languages over Group Languages is Regular.- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis.- Degrees of Restriction for Two-Dimensional Automata.- The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract) .- Guessing the Buffer Bound for k-Synchronizability.- The Commutative Closure of Shuffle Languages over Group Languages is Regular.- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers.- Ambiguity Hierarchies for Weighted Tree Automata.- Boolean Kernels of Context-Free Languages.- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton.-  Approximate Hashing for Bioinformatics.

Textul de pe ultima copertă

This book constitutes the thoroughly refereed papers of the 14th International Conference on Implementation and Application of Automata, CIAA 2009, held in Sydney, Austrialia,  in July 2009.
The 23 revised full papers togehter with 6 short papers were carefully selected from 42 submissions. The papers cover various topics in the theory, implementation, and applications of automata and related structures.