國立虎尾科技大學 |

Descriptional Complexity of Formal Systems = 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Descriptional Complexity of Formal Systems/ edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit.
其他題名:	18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /
其他作者:	Câmpeanu, Cezar.
面頁冊數:	XVI, 217 p. 50 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical logic. -
電子資源:	https://doi.org/10.1007/978-3-319-41114-9
ISBN:	9783319411149

Descriptional Complexity of Formal Systems = 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /
Descriptional Complexity of Formal Systems18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /[electronic resource] :edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit. - 1st ed. 2016. - XVI, 217 p. 50 illus.online resource. - Theoretical Computer Science and General Issues ;9777. - Theoretical Computer Science and General Issues ;9163.

Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuﬄe of Regular Languages -- MSO-deﬁnable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata.

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions. Descriptional Complexity is a ﬁeld in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, ﬁnte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. .

ISBN: 9783319411149

Standard No.: 10.1007/978-3-319-41114-9doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Descriptional Complexity of Formal Systems = 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /
LDR:03041nam a22004095i 4500 001 981233
003 DE-He213
005 20200705152311.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319411149 $9 978-3-319-41114-9
024 7 $a 10.1007/978-3-319-41114-9 $2 doi
035 $a 978-3-319-41114-9
050 4 $a QA8.9-10.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
245 1 0 $a Descriptional Complexity of Formal Systems $h [electronic resource] : $b 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / $c edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XVI, 217 p. 50 illus. $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 9777
505 0 $a Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuﬄe of Regular Languages -- MSO-deﬁnable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata.
520 $a his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions. Descriptional Complexity is a ﬁeld in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, ﬁnte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. .
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer logic. $3 786340
650 0 $a Computers. $3 565115
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
700 1 $a Câmpeanu, Cezar. $e editor. $1 https://orcid.org/0000-0002-9777-3012 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1273728
700 1 $a Manea, Florin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1067820
700 1 $a Shallit, Jeffrey. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 686234
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319411132
776 0 8 $i Printed edition: $z 9783319411156
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-41114-9
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)