Descriptional Complexity of Formal Systems
18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings| By: | null |
| Publisher: | Springer Nature |
| Print ISBN: | 9783319411132 |
| eText ISBN: | 9783319411149 |
| Edition: | 0 |
| Copyright: | 2016 |
| Format: | Reflowable |
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
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.