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 Cognitive Radio Oriented Wireless Networks by
Cover of the book Advances in Machine Learning and Signal Processing by
Cover of the book Crystallizing Ideas – The Role of Chemistry by
Cover of the book Surgery of the Skull Base by
Cover of the book The Soils of Wisconsin by
Cover of the book Universal Access in Human-Computer Interaction. Users and Context Diversity by
Cover of the book Computer Vision – ECCV 2016 by
Cover of the book Thriving Rough Sets by
Cover of the book Corporate Governance and Risk Management in Financial Institutions by
Cover of the book Resistant Hypertension in Chronic Kidney Disease by
Cover of the book War, Public Opinion and Policy in Britain, France and the Netherlands, 1785-1815 by
Cover of the book The Birth of Star Clusters by
Cover of the book Handbook on Project Management and Scheduling Vol.1 by
Cover of the book Recent Advances on Soft Computing and Data Mining by
Cover of the book Fairy Tales on the Teen Screen 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