000 | 03642nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-030-79121-6 | ||
003 | DE-He213 | ||
005 | 20240730165809.0 | ||
007 | cr nn 008mamaa | ||
008 | 210622s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030791216 _9978-3-030-79121-6 |
||
024 | 7 |
_a10.1007/978-3-030-79121-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aImplementation and Application of Automata _h[electronic resource] : _b25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / _cedited by Sebastian Maneth. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXIII, 191 p. 25 illus., 7 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 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12803 |
|
505 | 0 | _aPolyregular 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. | |
520 | _aThis 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. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aComputer engineering. _910164 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aLogic programming. _92730 |
|
650 | 1 | 4 |
_aTheory of Computation. _990645 |
650 | 2 | 4 |
_aComputer Engineering and Networks. _990646 |
650 | 2 | 4 |
_aLogic in AI. _933012 |
700 | 1 |
_aManeth, Sebastian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _990647 |
|
710 | 2 |
_aSpringerLink (Online service) _990648 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030791209 |
776 | 0 | 8 |
_iPrinted edition: _z9783030791223 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12803 _990649 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-79121-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c86541 _d86541 |