Narrow your search

Library

AP (3)

KDG (3)


Resource type

digital (3)


Language

English (3)


Year
From To Submit

2015 (1)

2014 (1)

2005 (1)

Listing 1 - 3 of 3
Sort by

Digital
Descriptional Complexity of Formal Systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Authors: ---
ISBN: 9783319192253 9783319192260 9783319192246 Year: 2015 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.


Digital
Descriptional Complexity of Formal Systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings
Authors: --- ---
ISBN: 9783319097046 Year: 2014 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Digital
Implementation and Application of Automata (vol. # 3317) : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers
Authors: --- --- ---
ISBN: 9783540305002 Year: 2005 Publisher: Berlin Heidelberg Springer-Verlag GmbH

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 3 of 3
Sort by