Compartir
Descriptional Complexity of Formal Systems: 16Th International Workshop, Dcfs 2014, Turku, Finland, August 5-8, 2014, Proceedings (Lecture Notes in Computer Science) (en Inglés)
Helmut Jurgensen (Autor)
·
Springer
· Tapa Blanda
Descriptional Complexity of Formal Systems: 16Th International Workshop, Dcfs 2014, Turku, Finland, August 5-8, 2014, Proceedings (Lecture Notes in Computer Science) (en Inglés) - Helmut Jurgensen
$ 86.56
$ 144.27
Ahorras: $ 57.71
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Jueves 08 de Agosto y el
Jueves 15 de Agosto.
Lo recibirás en cualquier lugar de Internacional entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Descriptional Complexity of Formal Systems: 16Th International Workshop, Dcfs 2014, Turku, Finland, August 5-8, 2014, Proceedings (Lecture Notes in Computer Science) (en Inglés)"
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.