1 option
Descriptional Complexity of Formal Systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8614.
- Theoretical Computer Science and General Issues ; 8614
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- Computer logic.
- Algorithms.
- Computer science--Mathematics.
- 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 Science.
- Local Subjects:
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XII, 366 pages) : 59 illustrations.
- Edition:
- First edition 2014.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-09704-6
- 9783319097046
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.