Jürgensen / Okhotin / Karhumäki | Descriptional Complexity of Formal Systems | Buch | 978-3-319-09703-9 | sack.de

Buch, Englisch, Band 8614, 366 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 5737 g

Reihe: Lecture Notes in Computer Science

Jürgensen / Okhotin / Karhumäki

Descriptional Complexity of Formal Systems

16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings
2014
ISBN: 978-3-319-09703-9
Verlag: Springer International Publishing

16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings

Buch, Englisch, Band 8614, 366 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 5737 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-319-09703-9
Verlag: Springer International Publishing


This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of objects, state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; complexity aspects of combinatorics on words; Kolmogorov complexity.

Jürgensen / Okhotin / Karhumäki Descriptional Complexity of Formal Systems jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Automata, grammars, languages and other formal systems.- Various modes of operation and complexity measures.- Trade-offs between computational models and modes of operation.- Succinctness of description of objects, state explosion-like phenomena.- Circuit complexity of Boolean functions and related measures.- Resource-bounded or structure-bounded environments.- Frontiers between decidability and undecidability.- Universality and reversibility.- Structural complexity.- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages).- Nature-motivated (bio-inspired) architectures and unconventional models of computing.- Complexity aspects of combinatorics on words.- Kolmogorov complexity.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.