Descriptional Complexity of Formal Systems

Alexander Okhotin

ISBN 10: 3319192248 / ISBN 13: 9783319192246

Verlag: Springer International Publishing, Springer International Publishing Mai 2015, 2015

Beschreibung

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 308 pp. Englisch.

Bestandsnummer des Verkäufers 9783319192246

Bibliografische Details

• Titel: Descriptional Complexity of Formal Systems
• Verlag: Springer International Publishing, Springer International Publishing Mai 2015
• Erscheinungsjahr: 2015
• Sprache: Englisch
• ISBN-10: 3319192248
• ISBN-13: 9783319192246
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 17 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 17 mm
• Gewicht: 470 Gramm

Über diesen Titel

Inhaltsangabe

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.