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 Chlamydomonas: Biotechnology and Biomedicine by
Cover of the book Business Modeling and Software Design by
Cover of the book ICTs for Improving Patients Rehabilitation Research Techniques by
Cover of the book Neuroimaging of Traumatic Brain Injury by
Cover of the book Human Virology in Latin America by
Cover of the book Principles of Applied Remote Sensing by
Cover of the book Maximum-Entropy Networks by
Cover of the book Entrepreneurial Finance for MSMEs by
Cover of the book Data Science and Big Data: An Environment of Computational Intelligence by
Cover of the book Nanomaterials and Plant Potential by
Cover of the book Deterministic Kinetics in Chemistry and Systems Biology by
Cover of the book Smart Micro-Grid Systems Security and Privacy by
Cover of the book Landscapes of Eternal Return by
Cover of the book The Notion of Activity in Chemistry by
Cover of the book Leading Global Innovation 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