"Descriptional Complexity of Formal Systems" - Information and Links:

Descriptional Complexity of Formal Systems - Info and Reading Options

15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings

Book's cover
The cover of “Descriptional Complexity of Formal Systems” - Open Library.

"Descriptional Complexity of Formal Systems" is published by Springer in Jul 19, 2013 and it has 299 pages.


“Descriptional Complexity of Formal Systems” Metadata:

  • Title: ➤  Descriptional Complexity of Formal Systems
  • Authors:
  • Number of Pages: 299
  • Publisher: Springer
  • Publish Date:

“Descriptional Complexity of Formal Systems” Subjects and Themes:

Edition Specifications:

  • Format: paperback

Edition Identifiers:

AI-generated Review of “Descriptional Complexity of Formal Systems”:


"Descriptional Complexity of Formal Systems" Description:

The Open Library:

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.

Read “Descriptional Complexity of Formal Systems”:

Read “Descriptional Complexity of Formal Systems” by choosing from the options below.

Search for “Descriptional Complexity of Formal Systems” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Descriptional Complexity of Formal Systems” in Libraries Near You:

Read or borrow “Descriptional Complexity of Formal Systems” from your local library.

Buy “Descriptional Complexity of Formal Systems” online:

Shop for “Descriptional Complexity of Formal Systems” on popular online marketplaces.