Limitar la búsqueda a ejemplares disponibles



Cubierta del libro
EBOOKS

Título 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.

Descripción física XII, 366 p. 59 illus. online resource.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Colección Lecture Notes in Computer Science, 0302-9743 ; 8614
Lecture Notes in Computer Science, 0302-9743 ; 8614
       Mostrar referencias similares
Springer eBooks. Computer Science
       Mostrar referencias similares
Contiene: 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.
Resumen: 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.
Materia Computer science.
Computers.
Algorithms.
Computer logic.
Mathematical logic.
Computer science -- Mathematics.
Computer Science.
       Mostrar referencias similares
Computation by Abstract Devices.
       Mostrar referencias similares
Mathematical Logic and Formal Languages.
       Mostrar referencias similares
Logics and Meanings of Programs.
       Mostrar referencias similares
Algorithm Analysis and Problem Complexity.
       Mostrar referencias similares
Discrete Mathematics in Computer Science.
       Mostrar referencias similares
Autor secundario Jürgensen, Helmut., editor.
Karhumäki, Juhani., editor.
Okhotin, Alexander., editor.
SpringerLink (Online service)
En Springer eBooks
OTRO SOPORTE Printed edition: 9783319097039
ISBN 9783319097046 978-3-319-09704-6
ISBN/ISSN 10.1007/978-3-319-09704-6 doi