國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Descriptional complexity of formal s...

(1998 :)

Descriptional complexity of formal systems22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Descriptional complexity of formal systemsedited by Galina Jiraskova, Giovanni Pighizzini.
其他題名:	22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020 : proceedings /
其他題名:	DCFS 2020
其他作者:	Jiraskova, Galina.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	x, 245 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Formal languagesCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-62536-8
ISBN:	9783030625368$q(electronic bk.)

Descriptional complexity of formal systems22nd 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] :DCFS 2020edited by Galina Jiraskova, Giovanni Pighizzini. - Cham :Springer International Publishing :2020. - x, 245 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,124420302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

443051
Formal languages
--Congresses.

LC Class. No.: QA76.9.L63 / D34 2020

Dewey Class. No.: 005.131

Descriptional complexity of formal systems22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020 : proceedings /
LDR:03181nmm a2200373 a 4500 001 589402
003 DE-He213
005 20201107020223.0
006 m d
007 cr nn 008maaau
008 210601s2020 sz s 0 eng d
020 $a 9783030625368$q(electronic bk.)
020 $a 9783030625351$q(paper)
024 7 $a 10.1007/978-3-030-62536-8 $2 doi
035 $a 978-3-030-62536-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.L63 $b D34 2020
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.131 $2 23
090 $a QA76.9.L63 $b D277 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 Jiraskova, Giovanni Pighizzini.
246 3 $a DCFS 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a x, 245 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12442
490 1 $a Theoretical computer science and general issues
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 Formal languages $v Congresses. $3 443051
650 0 $a Machine theory $v Congresses. $3 442590
650 0 $a Formal methods (Computer science) $3 277520
650 1 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Database Management. $3 273994
700 1 $a Jiraskova, Galina. $3 878337
700 1 $a Pighizzini, Giovanni. $3 522431
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-62536-8
950 $a Computer Science (SpringerNature-11645)