Name: 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)
Price: 213597.00 COP
Availability: InStock
Author: Helmut Jurgensen
ISBN: 9783319097039

portada 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)

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)

Formato

Libro Físico

Editorial

Springer

Autor

Helmut Jurgensen

Año

2014

Idioma

Inglés

N° páginas

366

Encuadernación

Tapa Blanda

ISBN13

9783319097039

N° edición

2014

Categorías

Teoría matemática de la computación
Aprendizaje automático («machine learning»)

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

Libro Nuevo Importado

Envío: 14 a 20 días háb.

$ 355.995$ 213.597

-40%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 213.597

¡Envío Gratis! Llega entre el 09 Jul y el 21 Jul a Bogota, Cundinamarca. Seleccionar ubicación

Agregar a lista de deseos

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.