Descriptional Complexity of Formal Systems [[electronic resource] ] : 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings / / edited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Descriptional Complexity of Formal Systems [[electronic resource] ] : 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings / / edited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Edizione: | 1st ed. 2011. |
| Descrizione fisica: | 1 online resource (X, 329 p. 59 illus., 1 illus. in color.) |
| Disciplina: | 004.0151 |
| Soggetto topico: | Computer science |
| Software engineering | |
| Machine theory | |
| Theory of Computation | |
| Software Engineering | |
| Formal Languages and Automata Theory | |
| Computer Science Logic and Foundations of Programming | |
| Persona (resp. second.): | HolzerMarkus |
| KutribMartin | |
| PighizziniGiovanni | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and author index. |
| Sommario/riassunto: | 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. |
| Titolo autorizzato: | Descriptional Complexity of Formal Systems |
| ISBN: | 3-642-22600-0 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465750903316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 6808