Descriptional Complexity of Formal Systems - 13 International Workshop, DCFS 2011, Giessen/Limburg, Germany, July 25-27, 2011. Proceedings (Paperback, 2011 ed.)


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.

R1,570

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles15700
Mobicred@R147pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer-Verlag

Country of origin

Germany

Series

Lecture Notes in Computer Science, 6808

Release date

July 2011

Availability

Expected to ship within 10 - 15 working days

First published

2011

Editors

, ,

Dimensions

235 x 155 x 18mm (L x W x T)

Format

Paperback

Pages

329

Edition

2011 ed.

ISBN-13

978-3-642-22599-4

Barcode

9783642225994

Categories

LSN

3-642-22599-3



Trending On Loot