Overview
- Fast track conference proceedings
- Unique visibility
- State of the art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8031)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: DCFS 2013.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
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.
Similar content being viewed by others
Keywords
Table of contents (26 papers)
-
Front Matter
Other volumes
-
Descriptional Complexity of Formal Systems
Editors and Affiliations
Bibliographic Information
Book Title: Descriptional Complexity of Formal Systems
Book Subtitle: 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings
Editors: Helmut Jurgensen, Rogério Reis
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-39310-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Softcover ISBN: 978-3-642-39309-9Published: 19 July 2013
eBook ISBN: 978-3-642-39310-5Published: 14 June 2013
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 289
Number of Illustrations: 56 b/w illustrations
Topics: Computation by Abstract Devices, Mathematical Logic and Formal Languages, Logics and Meanings of Programs, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science