Cantitate/Preț
Produs

Descriptional Complexity of Formal Systems

Editat de Martin Kutrib, Nelma Moreira, Rogério Reis
en Limba Engleză Paperback – 18 iul 2012
This book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012.
The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity.
Citește tot Restrânge

Preț: 32381 lei

Preț vechi: 40476 lei
-20%

Puncte Express: 486

Carte tipărită la comandă

Livrare economică 06-20 iunie


Specificații

ISBN-13: 9783642316227
ISBN-10: 3642316220
Pagini: 332
Ilustrații: X, 319 p. 23 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2012
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012.
The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity.

Caracteristici

Fast track conference proceedings Unique visibility State of the art research