Descriptional Complexity of Formal Systems
. Ed(S): Holzer, Markus; Kutrib, Martin; Pighizzini, Giovanni
€ 67.36
FREE Delivery in Ireland
Description for Descriptional Complexity of Formal Systems
Paperback. Offers proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011. This title covers topics such as: trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; and, circuit complexity of Boolean functions and related measures. Editor(s): Holzer, Markus; Kutrib, Martin; Pighizzini, Giovanni. Series: Lecture Notes in Computer Science / Theoretical Computer Science and General Issues. Num Pages: 339 pages, 58 black & white illustrations, 1 colour illustrations, biography. BIC Classification: UMZ; UYA; UYZG. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 18. Weight in Grams: 478.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2011
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
339
Condition
New
Series
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Number of Pages
329
Place of Publication
Berlin, Germany
ISBN
9783642225994
SKU
V9783642225994
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Descriptional Complexity of Formal Systems