Articoli correlati a Descriptional Complexity of Formal Systems: 17th Internation...

Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings: 17th International Workshop, Dcfs 2015, Proceedings: 9118 - Brossura

 
9783319192246: Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings: 17th International Workshop, Dcfs 2015, Proceedings: 9118
Brossura
ISBN 10: 3319192248 ISBN 13: 9783319192246
Casa editrice: Springer, 2015

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2015
Lingua
Inglese
ISBN 10 
3319192248
ISBN 13 
9783319192246
Rilegatura
Copertina flessibile
Numero di pagine
308
Redattore
Shallit Jeffrey, Okhotin Alexander
Contatto del produttore
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3,69115 Heidelberg, Germany
Heidelberg
Germania