Descriptional Complexity of Formal Systems [recurso electrónico] : 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings / edited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini.

Por: Holzer, Markus [editor.]Colaborador(es): Kutrib, Martin [editor.] | Pighizzini, Giovanni [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 6808Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: X, 329p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642226007Tema(s): Computer science | Software engineering | Logic design | Computer Science | Computation by Abstract Devices | Software Engineering | Mathematical Logic and Formal Languages | Logics and Meanings of ProgramsFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 004.0151 Clasificación LoC:QA75.5-76.95Recursos en línea: Libro electrónicoTexto En: Springer eBooksResumen: This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 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.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos QA75.5 -76.95 (Browse shelf(Abre debajo)) 1 No para préstamo 376517-2001

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 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.

19

Con tecnología Koha