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 Automatic Syntactic Analysis Based on Selectional Preferences by
Cover of the book Public Service Broadcasting and Media Systems in Troubled European Democracies by
Cover of the book Nonautonomous Linear Hamiltonian Systems: Oscillation, Spectral Theory and Control by
Cover of the book The Economics of Brexit by
Cover of the book Security and Fault Tolerance in Internet of Things by
Cover of the book On-Surface Synthesis by
Cover of the book Revolutionary Committees in the Cultural Revolution Era of China by
Cover of the book Finding Political Identities by
Cover of the book VLSI-SoC: Internet of Things Foundations by
Cover of the book Digital Pathology by
Cover of the book Quality of Life and Daily Travel by
Cover of the book ‘Now I Know’: Five Centuries of Aqedah Exegesis by
Cover of the book Democratizing Candidate Selection by
Cover of the book Anthocyanins and Human Health: Biomolecular and therapeutic aspects by
Cover of the book Methodological Reflections on Researching Communication and Social Change 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