Get Free Shipping on orders over $79
Descriptional Complexity of Formal Systems : 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings

Descriptional Complexity of Formal Systems

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

eText | 14 June 2013

At a Glance

eText


$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

More in Algorithms & Data Structures

Addiction by Design : Machine Gambling in Las Vegas - Natasha Dow Schüll

eBOOK

Deep Learning Crash Course - Giovanni Volpe

eBOOK

RRP $81.07

$64.99

20%
OFF