000			03323nam a22004095i 4500
999			_c368124 _d368124 _x1
001			368124
003			ES-MaUEC
005			20230102121710.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			211224s2021 sz | s |||| 0|eng d
020			_a9783030934897
024	7		_a10.1007/978-3-030-93489-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA267.3 _b2021 EB
245	0	0	_aDescriptional Complexity of Formal Systems : _b23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings _cedited by Yo-Sub Han, Sang-Ki Ko
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (X, 201 páginas) _b30 ilustraciones, 5 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_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.
988			_aSpringer_Computer_2022
650		7	_2embne _9154256 _aLenguajes formales _vCongresos
700	1		_aHan, Yo-Sub _eeditor literario
700	1		_aKo, Sang-Ki _eeditor literario
773	0		_tSpringer Nature eBook
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-93489-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE _n0
998			_b03/2022 _dz _eu _zSI