Descriptional Complexity of Formal Systems
18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
Buch in deiner Nähe kaufen
Beschreibung
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.
Includes supplementary material: sn.pub/extras
Autor*in
Cezar Câmpeanu
Themen in »Descriptional Complexity of Formal Systems«
automata theory context free languages formal languages regular languages turing machines automata extensions computational completeness descriptional complexity measures deterministic finite automaton grammars graph-controlled systems information theory insertion-deletion systems models of computation quantitative automata