國立虎尾科技大學 |

Descriptional Complexity of Formal Systems = 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Descriptional Complexity of Formal Systems/ edited by Yo-Sub Han, Sang-Ki Ko.
Reminder of title:	23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /
other author:	Han, Yo-Sub.
Description:	X, 201 p. 30 illus., 5 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer logic. -
Online resource:	https://doi.org/10.1007/978-3-030-93489-7
ISBN:	9783030934897

Descriptional Complexity of Formal Systems = 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /
Descriptional Complexity of Formal Systems23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /[electronic resource] :edited by Yo-Sub Han, Sang-Ki Ko. - 1st ed. 2021. - X, 201 p. 30 illus., 5 illus. in color.online resource. - Theoretical Computer Science and General Issues ;13037. - Theoretical Computer Science and General Issues ;9163.

Complexity 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.

This 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.

ISBN: 9783030934897

Standard No.: 10.1007/978-3-030-93489-7doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Descriptional Complexity of Formal Systems = 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /
LDR:03200nam a22004335i 4500 001 1057943
003 DE-He213
005 20211224182329.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030934897 $9 978-3-030-93489-7
024 7 $a 10.1007/978-3-030-93489-7 $2 doi
035 $a 978-3-030-93489-7
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Descriptional Complexity of Formal Systems $h [electronic resource] : $b 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / $c edited by Yo-Sub Han, Sang-Ki Ko.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a X, 201 p. 30 illus., 5 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 13037
505 0 $a Complexity 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 $a This 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 $a Computer logic. $3 786340
650 1 4 $a Logics and Meanings of Programs. $3 670058
700 1 $a Han, Yo-Sub. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1111290
700 1 $a Ko, Sang-Ki. $e editor. $1 https://orcid.org/0000-0002-5406-5104 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1363484
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030934880
776 0 8 $i Printed edition: $z 9783030934903
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-93489-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)