Cantitate/Preț
Produs

Descriptional Complexity of Formal Systems: Lecture Notes in Computer Science, cartea 8614

Editat de Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
en Limba Engleză Paperback – 21 iul 2014
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33928 lei

Preț vechi: 42411 lei
-20%

Puncte Express: 509

Carte tipărită la comandă

Livrare economică 17-31 octombrie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783319097039
ISBN-10: 3319097032
Pagini: 380
Ilustrații: XII, 366 p. 59 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2014
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.