Scientific Library of Tomsk State University

   E-catalog        

Normal view MARC view

Descriptional Complexity of Formal Systems electronic resource 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin.

Contributor(s): Jürgensen, Helmut [editor.] | Karhumäki, Juhani [editor.] | Okhotin, Alexander [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer SciencePublication details: Cham : Springer International Publishing : Imprint: Springer, 2014Description: XII, 366 p. 59 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319097046Subject(s): Computer Science | Computer software | Logic design | Computational complexity | Computer Science | Computation by Abstract Devices | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer ScienceDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of 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 -- Complexity aspects of combinatorics on words -- Kolmogorov complexity.
In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of 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; complexity aspects of combinatorics on words; Kolmogorov complexity.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of 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 -- Complexity aspects of combinatorics on words -- Kolmogorov complexity.

This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of 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; complexity aspects of combinatorics on words; Kolmogorov complexity.

There are no comments on this title.

to post a comment.
Share