0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings (Paperback, 2013 ed.) Loot Price: R1,558
Discovery Miles 15 580
Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013,...

Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings (Paperback, 2013 ed.)

Jurgensen, Rogerio Reis

Series: Theoretical Computer Science and General Issues, 8031

 (sign in to rate)
Loot Price R1,558 Discovery Miles 15 580 | Repayment Terms: R146 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. The 22 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 46 submissions. The topics covered are automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems; succinctness of description of objects, state-explosion-like phenomena; circuit complexity of Boolean functions and related measures; size complexity and structural complexity of formal systems; trade-offs between computational models and mode of operation; applications of formal systems; for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages; and their complexity constraints; size or structural complexity of formal systems for modeling natural languages; complexity aspects related to the combinatorics of words; descriptional complexity in resource-bounded or structure-bounded environments; structural complexity as related to descriptional complexity; frontiers between decidability and undecidability; universality and reversibility; nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov-Chaitin complexity, algorithmic information.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Theoretical Computer Science and General Issues, 8031
Release date: June 2013
First published: 2013
Editors: Jurgensen • Rogerio Reis
Dimensions: 235 x 155 x 15mm (L x W x T)
Format: Paperback
Pages: 289
Edition: 2013 ed.
ISBN-13: 978-3-642-39309-9
Categories: Books > Science & Mathematics > Mathematics > General
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
LSN: 3-642-39309-8
Barcode: 9783642393099

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners