Descriptional Complexity of Formal Systems 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Shallit, Jeffrey (Επιμελητής έκδοσης), Okhotin, Alexander (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2015.
• Σειρά: Lecture Notes in Computer Science, 9118
• Θέματα: Computer science.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Computation by Abstract Devices.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.
• Φυσική περιγραφή: XII, 293 p. 48 illus. online resource.
• ISBN: 9783319192253
• ISSN: 0302-9743 ;

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.