Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/563
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKonstantinidis, Stavros. ;en_US
dc.contributor.authorPighizzini, Giovanni. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:18:54Z-
dc.date.available2020-05-17T08:18:54Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319946313 ;en_US
dc.identifier.isbn9783319946306 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/563-
dc.descriptionPrinted edition: ; 9783319946306. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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.statementofresponsibilityedited by Stavros Konstantinidis, Giovanni Pighizzini.en_US
dc.description.tableofcontentsFormal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ;en_US
dc.format.extentXIV, 251 p. 35 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.haspart9783319946306.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputer logic. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputational linguistics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectLogics and Meanings of Programs. ;en_US
dc.subjectLanguage Translation and Linguistics. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc005.1015113 ; 23 ;en_US
dc.subject.lccQA76.63 ;en_US
dc.titleDescriptional Complexity of Formal Systemsen_US
dc.title.alternative20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319946306.pdf5.79 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKonstantinidis, Stavros. ;en_US
dc.contributor.authorPighizzini, Giovanni. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:18:54Z-
dc.date.available2020-05-17T08:18:54Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319946313 ;en_US
dc.identifier.isbn9783319946306 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/563-
dc.descriptionPrinted edition: ; 9783319946306. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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.statementofresponsibilityedited by Stavros Konstantinidis, Giovanni Pighizzini.en_US
dc.description.tableofcontentsFormal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ;en_US
dc.format.extentXIV, 251 p. 35 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.haspart9783319946306.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputer logic. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputational linguistics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectLogics and Meanings of Programs. ;en_US
dc.subjectLanguage Translation and Linguistics. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc005.1015113 ; 23 ;en_US
dc.subject.lccQA76.63 ;en_US
dc.titleDescriptional Complexity of Formal Systemsen_US
dc.title.alternative20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319946306.pdf5.79 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKonstantinidis, Stavros. ;en_US
dc.contributor.authorPighizzini, Giovanni. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:18:54Z-
dc.date.available2020-05-17T08:18:54Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319946313 ;en_US
dc.identifier.isbn9783319946306 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/563-
dc.descriptionPrinted edition: ; 9783319946306. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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.statementofresponsibilityedited by Stavros Konstantinidis, Giovanni Pighizzini.en_US
dc.description.tableofcontentsFormal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. ;en_US
dc.format.extentXIV, 251 p. 35 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10952. ;en_US
dc.relation.haspart9783319946306.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputer logic. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputational linguistics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectLogics and Meanings of Programs. ;en_US
dc.subjectLanguage Translation and Linguistics. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc005.1015113 ; 23 ;en_US
dc.subject.lccQA76.63 ;en_US
dc.titleDescriptional Complexity of Formal Systemsen_US
dc.title.alternative20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25ee27, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319946306.pdf5.79 MBAdobe PDFThumbnail
Preview File