Muutke küpsiste eelistusi

Implementation and Application of Automata: 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 1922, 2023, Proceedings 1st ed. 2023 [Pehme köide]

Edited by
  • Formaat: Paperback / softback, 304 pages, kõrgus x laius: 235x155 mm, kaal: 486 g, 16 Illustrations, color; 65 Illustrations, black and white; XII, 304 p. 81 illus., 16 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14151
  • Ilmumisaeg: 10-Aug-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031402464
  • ISBN-13: 9783031402463
Teised raamatud teemal:
  • Pehme köide
  • Hind: 62,59 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 73,64 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Implementation and Application of Automata: 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 1922, 2023, Proceedings 1st ed. 2023Suurem pilt
  • Formaat: Paperback / softback, 304 pages, kõrgus x laius: 235x155 mm, kaal: 486 g, 16 Illustrations, color; 65 Illustrations, black and white; XII, 304 p. 81 illus., 16 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14151
  • Ilmumisaeg: 10-Aug-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031402464
  • ISBN-13: 9783031402463
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031402463.html
Märksõnad:
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 1922, 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.
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.