Descriptional Complexity of Formal Systems 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions....

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Câmpeanu, Cezar (Editor ), Manea, Florin (Editor ), Shallit, Jeffrey (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Colección:Theoretical Computer Science and General Issues, 9777
Temas:
Machine theory.
Computer science.
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Theory of Computation.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Descripción
Sumario:his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions. Descriptional Complexity is a field in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, finte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. .
Descripción Física:XVI, 217 p. 50 illus. online resource.
ISBN:9783319411149
ISSN:2512-2029 ;

Ejemplares similares