| 000 | 03577nam a22004335i 4500 | ||
|---|---|---|---|
| 988 | _aSpringer_Computer_2022 | ||
| 999 |
_c382960 _d382960 _x1 |
||
| 001 | 382960 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230102122030.0 | ||
| 006 | a||||fo|||| 00| 0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 221008s2022 sz | s |1|| 0|eng d | ||
| 020 | _a9783031074691 | ||
| 024 | 7 |
_a10.1007/978-3-031-07469-1 _2doi |
|
| 040 |
_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC |
||
| 050 | 4 |
_aQA267 _b2022 EB |
|
| 245 | 0 | 0 |
_aImplementation and Application of Automata : _b26th International Conference, CIAA 2022, Rouen, France, June 28 - July 1, 2022, Proceedings _cedited by Pascal Caron, Ludovic Mignot |
| 250 | _aFirst edition 2022 | ||
| 264 | 1 |
_aCham _bSpringer International Publising _c2022 |
|
| 300 |
_a1 recurso en línea (X, 251 páginas) _b62 ilustraciones, 17 ilustraciones a color |
||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 347 |
_aarchivo de texto _bPDF |
||
| 490 | 0 |
_aLecture Notes in Computer Science _x1611-3349 _v13266 |
|
| 505 | 0 | _aOn 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. | |
| 520 | _aThis 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. | ||
| 650 | 7 |
_2embne _9405064 _aModelos matemáticos _vCongresos y asambleas |
|
| 650 | 7 |
_2embne _9669117 _aAutómatas celulares _vCongresos y asambleas |
|
| 700 | 1 |
_aCaron, Pascal _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aMignot, Ludovic _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 776 | 0 | 8 |
_iPrinted edition: _z9783031074684 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031074707 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-07469-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 942 |
_2lcc _cLE |
||
| 998 |
_b10/2022 _dz _eIG _zSI |
||