| 000 | 03658nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-93489-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730181004.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 211224s2021 sz | s |||| 0|eng d | ||
| 020 |
_a9783030934897 _9978-3-030-93489-7 |
||
| 024 | 7 |
_a10.1007/978-3-030-93489-7 _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 |
_aDescriptional Complexity of Formal Systems _h[electronic resource] : _b23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / _cedited by Yo-Sub Han, Sang-Ki Ko. |
| 250 | _a1st ed. 2021. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
| 300 |
_aX, 201 p. 30 illus., 5 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 ; _v13037 |
|
| 505 | 0 | _aComplexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata. | |
| 520 | _aThis book constitutes the proceedings of the 23rd International Conference on Descriptional Complexity of Format Systems, DCFS 2021, which was supposed to take place in Seoul South Korea in June 2021, but the conference was canceled due to the COVID-19 crisis. The 16 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The conference focus to all aspects of descriptional complexity-the costs of description of objects in various computational models such as Turing machines, pushdown automata, finite automata or grammars. | ||
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 700 | 1 |
_aHan, Yo-Sub. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9122850 |
|
| 700 | 1 |
_aKo, Sang-Ki. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9122851 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9122852 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030934880 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030934903 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v13037 _9122853 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-93489-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c90627 _d90627 |
||