Descriptional Complexity of Formal Systems

17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

Nonfiction, Computers, Advanced Computing, Theory, Science & Nature, Mathematics, Logic, General Computing
Cover of the book Descriptional Complexity of Formal Systems by , Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9783319192253
Publisher: Springer International Publishing Publication: June 15, 2015
Imprint: Springer Language: English
Author:
ISBN: 9783319192253
Publisher: Springer International Publishing
Publication: June 15, 2015
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Narratives of Social Justice Educators by
Cover of the book Knowledge Management in Organizations by
Cover of the book Water-Conservation Traits to Increase Crop Yields in Water-deficit Environments by
Cover of the book Analysis and Presentation of Experimental Results by
Cover of the book Calcium Entry Pathways in Non-excitable Cells by
Cover of the book Human Interface and the Management of Information: Supporting Learning, Decision-Making and Collaboration by
Cover of the book Emerging Powers in Africa by
Cover of the book Lichen Secondary Metabolites by
Cover of the book Proceedings of the 3rd International Conference on Intelligent Technologies and Engineering Systems (ICITES2014) by
Cover of the book Air Pollution Modeling and its Application XXIII by
Cover of the book Healing the Wounds of Gukurahundi in Zimbabwe by
Cover of the book Explaining Monetary and Financial Innovation by
Cover of the book Advanced Topics on Computer Vision, Control and Robotics in Mechatronics by
Cover of the book Robotics and Mechatronics by
Cover of the book Modeling Life by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy