Descriptional Complexity of Formal Systems 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Jürgensen, Helmut (Επιμελητής έκδοσης), Karhumäki, Juhani (Επιμελητής έκδοσης), Okhotin, Alexander (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2014.
• Σειρά: Lecture Notes in Computer Science, 8614
• Θέματα: Computer science.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Computation by Abstract Devices.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.

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 f...

Πίνακας περιεχομένων:

• 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.