My Account Log in

1 option

Descriptional Complexity of Formal Systems : 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings / edited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Holzer, Markus, Editor.
Kutrib, Martin, Editor.
Pighizzini, Giovanni, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 6808
Theoretical Computer Science and General Issues, 2512-2029 ; 6808
Language:
English
Subjects (All):
Computer science.
Software engineering.
Machine theory.
Theory of Computation.
Software Engineering.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Local Subjects:
Theory of Computation.
Software Engineering.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Physical Description:
1 online resource (X, 329 pages) : 59 illustrations, 1 illustrations in color.
Edition:
1st ed. 2011.
Contained In:
Springer Nature eBook
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
System Details:
text file PDF
Summary:
This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity.
Other Format:
Printed edition:
ISBN:
978-3-642-22600-7
9783642226007
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account