Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/360210
Title: Descriptional Complexity of Formal Systems
Other Titles: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Authors: Shallit, Jeffrey.;Okhotin, Alexander.
subject: Computer Science;Computer software.;Logic design.;Computational complexity.;Computer Science;Computation by Abstract Devices.;Mathematical Logic and Formal Languages.;Logics and Meanings of Programs.;Algorithm Analysis and Problem Complexity.;Discrete M;4.0151;QA75.5-76.95
Year: 2015
place: Cham
Publisher: Springer International Publishing :.
Imprint: Springer,
Series/Report no.: Lecture Notes in Computer Science, 0302-9743 9118.
Lecture Notes in Computer Science, 0302-9743 9118.
Abstract: This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.
Description: Printed edition: 9783319192246.
URI: http://46.100.53.162/handle/Ebook/50558
http://localhost/handle/Hannan/360210
ISBN: 9783319192253.
9783319192246 (print)
Appears in Collections:Computer

Files in This Item:
File Description SizeFormat 
9783319192253.pdf6.8 MBAdobe PDFThumbnail
Preview File
Title: Descriptional Complexity of Formal Systems
Other Titles: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Authors: Shallit, Jeffrey.;Okhotin, Alexander.
subject: Computer Science;Computer software.;Logic design.;Computational complexity.;Computer Science;Computation by Abstract Devices.;Mathematical Logic and Formal Languages.;Logics and Meanings of Programs.;Algorithm Analysis and Problem Complexity.;Discrete M;4.0151;QA75.5-76.95
Year: 2015
place: Cham
Publisher: Springer International Publishing :.
Imprint: Springer,
Series/Report no.: Lecture Notes in Computer Science, 0302-9743 9118.
Lecture Notes in Computer Science, 0302-9743 9118.
Abstract: This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.
Description: Printed edition: 9783319192246.
URI: http://46.100.53.162/handle/Ebook/50558
http://localhost/handle/Hannan/360210
ISBN: 9783319192253.
9783319192246 (print)
Appears in Collections:Computer

Files in This Item:
File Description SizeFormat 
9783319192253.pdf6.8 MBAdobe PDFThumbnail
Preview File
Title: Descriptional Complexity of Formal Systems
Other Titles: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Authors: Shallit, Jeffrey.;Okhotin, Alexander.
subject: Computer Science;Computer software.;Logic design.;Computational complexity.;Computer Science;Computation by Abstract Devices.;Mathematical Logic and Formal Languages.;Logics and Meanings of Programs.;Algorithm Analysis and Problem Complexity.;Discrete M;4.0151;QA75.5-76.95
Year: 2015
place: Cham
Publisher: Springer International Publishing :.
Imprint: Springer,
Series/Report no.: Lecture Notes in Computer Science, 0302-9743 9118.
Lecture Notes in Computer Science, 0302-9743 9118.
Abstract: This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.
Description: Printed edition: 9783319192246.
URI: http://46.100.53.162/handle/Ebook/50558
http://localhost/handle/Hannan/360210
ISBN: 9783319192253.
9783319192246 (print)
Appears in Collections:Computer

Files in This Item:
File Description SizeFormat 
9783319192253.pdf6.8 MBAdobe PDFThumbnail
Preview File