Please use this identifier to cite or link to this item:
http://localhost/handle/Hannan/563
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Konstantinidis, Stavros. ; | en_US |
dc.contributor.author | Pighizzini, Giovanni. ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:18:54Z | - |
dc.date.available | 2020-05-17T08:18:54Z | - |
dc.date.issued | 2018 | en_US |
dc.identifier.isbn | 9783319946313 ; | en_US |
dc.identifier.isbn | 9783319946306 (print) ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/563 | - |
dc.description | Printed edition: ; 9783319946306. ; | en_US |
dc.description | SpringerLink (Online service) ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description.abstract | This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more. . ; | en_US |
dc.description.statementofresponsibility | edited by Stavros Konstantinidis, Giovanni Pighizzini. | en_US |
dc.description.tableofcontents | Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ; | en_US |
dc.format.extent | XIV, 251 p. 35 illus. ; online resource. ; | en_US |
dc.publisher | Springer International Publishing : | en_US |
dc.publisher | Imprint: Springer, | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.haspart | 9783319946306.pdf | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Data structures (Computer science). ; | en_US |
dc.subject | Computer logic. ; | en_US |
dc.subject | Computer Science and Mathematics | en_US |
dc.subject | Computational linguistics. ; | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Logics and Meanings of Programs. ; | en_US |
dc.subject | Language Translation and Linguistics. ; | en_US |
dc.subject | Discrete Mathematics in Computer Science. ; | en_US |
dc.subject | Data Structures. ; | en_US |
dc.subject.ddc | 005.1015113 ; 23 ; | en_US |
dc.subject.lcc | QA76.63 ; | en_US |
dc.title | Descriptional Complexity of Formal Systems | en_US |
dc.title.alternative | 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings / | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham : | en_US |
Appears in Collections: | مدیریت فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319946306.pdf | 5.79 MB | Adobe PDF | Preview File |
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Konstantinidis, Stavros. ; | en_US |
dc.contributor.author | Pighizzini, Giovanni. ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:18:54Z | - |
dc.date.available | 2020-05-17T08:18:54Z | - |
dc.date.issued | 2018 | en_US |
dc.identifier.isbn | 9783319946313 ; | en_US |
dc.identifier.isbn | 9783319946306 (print) ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/563 | - |
dc.description | Printed edition: ; 9783319946306. ; | en_US |
dc.description | SpringerLink (Online service) ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description.abstract | This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more. . ; | en_US |
dc.description.statementofresponsibility | edited by Stavros Konstantinidis, Giovanni Pighizzini. | en_US |
dc.description.tableofcontents | Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ; | en_US |
dc.format.extent | XIV, 251 p. 35 illus. ; online resource. ; | en_US |
dc.publisher | Springer International Publishing : | en_US |
dc.publisher | Imprint: Springer, | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.haspart | 9783319946306.pdf | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Data structures (Computer science). ; | en_US |
dc.subject | Computer logic. ; | en_US |
dc.subject | Computer Science and Mathematics | en_US |
dc.subject | Computational linguistics. ; | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Logics and Meanings of Programs. ; | en_US |
dc.subject | Language Translation and Linguistics. ; | en_US |
dc.subject | Discrete Mathematics in Computer Science. ; | en_US |
dc.subject | Data Structures. ; | en_US |
dc.subject.ddc | 005.1015113 ; 23 ; | en_US |
dc.subject.lcc | QA76.63 ; | en_US |
dc.title | Descriptional Complexity of Formal Systems | en_US |
dc.title.alternative | 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings / | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham : | en_US |
Appears in Collections: | مدیریت فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319946306.pdf | 5.79 MB | Adobe PDF | Preview File |
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Konstantinidis, Stavros. ; | en_US |
dc.contributor.author | Pighizzini, Giovanni. ; | en_US |
dc.date.accessioned | 2013 | en_US |
dc.date.accessioned | 2020-05-17T08:18:54Z | - |
dc.date.available | 2020-05-17T08:18:54Z | - |
dc.date.issued | 2018 | en_US |
dc.identifier.isbn | 9783319946313 ; | en_US |
dc.identifier.isbn | 9783319946306 (print) ; | en_US |
dc.identifier.uri | http://localhost/handle/Hannan/563 | - |
dc.description | Printed edition: ; 9783319946306. ; | en_US |
dc.description | SpringerLink (Online service) ; | en_US |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description | en_US | |
dc.description.abstract | This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more. . ; | en_US |
dc.description.statementofresponsibility | edited by Stavros Konstantinidis, Giovanni Pighizzini. | en_US |
dc.description.tableofcontents | Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ; | en_US |
dc.format.extent | XIV, 251 p. 35 illus. ; online resource. ; | en_US |
dc.publisher | Springer International Publishing : | en_US |
dc.publisher | Imprint: Springer, | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ; | en_US |
dc.relation.haspart | 9783319946306.pdf | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Data structures (Computer science). ; | en_US |
dc.subject | Computer logic. ; | en_US |
dc.subject | Computer Science and Mathematics | en_US |
dc.subject | Computational linguistics. ; | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Logics and Meanings of Programs. ; | en_US |
dc.subject | Language Translation and Linguistics. ; | en_US |
dc.subject | Discrete Mathematics in Computer Science. ; | en_US |
dc.subject | Data Structures. ; | en_US |
dc.subject.ddc | 005.1015113 ; 23 ; | en_US |
dc.subject.lcc | QA76.63 ; | en_US |
dc.title | Descriptional Complexity of Formal Systems | en_US |
dc.title.alternative | 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings / | en_US |
dc.type | Book | en_US |
dc.publisher.place | Cham : | en_US |
Appears in Collections: | مدیریت فناوری اطلاعات |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9783319946306.pdf | 5.79 MB | Adobe PDF | Preview File |