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 Advances in Robust Fractional Control by
Cover of the book Alternative Schooling and Student Engagement by
Cover of the book Advanced Customization in Architectural Design and Construction by
Cover of the book Future and Emergent Trends in Language Technology by
Cover of the book Metaphorical Signs in Computed Tomography of Chest and Abdomen by
Cover of the book Dynamics in Logistics by
Cover of the book Mutual Recognition of Judicial Decisions in European Criminal Law by
Cover of the book The Making and Meaning of Relationships in Sri Lanka by
Cover of the book Understanding China Today by
Cover of the book Engineering Design Applications by
Cover of the book Statistical Mechanics for Engineers by
Cover of the book Applications of Location Analysis by
Cover of the book Pathology of the Maxillofacial Bones by
Cover of the book Electronic Design Automation of Analog ICs combining Gradient Models with Multi-Objective Evolutionary Algorithms by
Cover of the book Performing Statelessness in Europe 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