國立虎尾科技大學 |

Descriptional Complexity of Formal Systems = 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Descriptional Complexity of Formal Systems/ edited by Galina Jirásková, Giovanni Pighizzini.
其他題名:	22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings /
其他作者:	Jirásková, Galina.
面頁冊數:	X, 245 p. 327 illus., 9 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer logic. -
電子資源:	https://doi.org/10.1007/978-3-030-62536-8
ISBN:	9783030625368

Descriptional Complexity of Formal Systems = 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings /
Descriptional Complexity of Formal Systems22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings /[electronic resource] :edited by Galina Jirásková, Giovanni Pighizzini. - 1st ed. 2020. - X, 245 p. 327 illus., 9 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12442. - Theoretical Computer Science and General Issues ;9163.

Mutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ω-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II.

This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

ISBN: 9783030625368

Standard No.: 10.1007/978-3-030-62536-8doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Descriptional Complexity of Formal Systems = 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings /
LDR:03459nam a22004335i 4500 001 1023441
003 DE-He213
005 20201107020223.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030625368 $9 978-3-030-62536-8
024 7 $a 10.1007/978-3-030-62536-8 $2 doi
035 $a 978-3-030-62536-8
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 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings / $c edited by Galina Jirásková, Giovanni Pighizzini.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 245 p. 327 illus., 9 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 12442
505 0 $a Mutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ω-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II.
520 $a This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.
650 0 $a Computer logic. $3 786340
650 0 $a Artificial intelligence. $3 559380
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Database management. $3 557799
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Database Management. $3 669820
700 1 $a Jirásková, Galina. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301822
700 1 $a Pighizzini, Giovanni. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 786274
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030625351
776 0 8 $i Printed edition: $z 9783030625375
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-62536-8
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)