000 | 04034nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-031-07469-1 | ||
003 | DE-He213 | ||
005 | 20240423125153.0 | ||
007 | cr nn 008mamaa | ||
008 | 220527s2022 sz | s |||| 0|eng d | ||
020 |
_a9783031074691 _9978-3-031-07469-1 |
||
024 | 7 |
_a10.1007/978-3-031-07469-1 _2doi |
|
050 | 4 | _aQA76.9.N38 | |
072 | 7 |
_aUYQL _2bicssc |
|
072 | 7 |
_aCOM073000 _2bisacsh |
|
072 | 7 |
_aUYQL _2thema |
|
082 | 0 | 4 |
_a006.35 _223 |
245 | 1 | 0 |
_aImplementation and Application of Automata _h[electronic resource] : _b26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings / _cedited by Pascal Caron, Ludovic Mignot. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
300 |
_aX, 251 p. 62 illus., 17 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_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 | 0 | _aNatural language processing (Computer science). | |
650 | 0 | _aDatabase management. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aLogic programming. | |
650 | 1 | 4 | _aNatural Language Processing (NLP). |
650 | 2 | 4 | _aDatabase Management. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aLogic in AI. |
700 | 1 |
_aCaron, Pascal. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMignot, Ludovic. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031074684 |
776 | 0 | 8 |
_iPrinted edition: _z9783031074707 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13266 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-07469-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c175027 _d175027 |