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

List of contents

Completely Reachable Automata.- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy.- Heapability, interactive particle systems, partial orders: results and open problems.- Self-Verifying Finite Automata and Descriptional Complexity.- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection.- Unrestricted State Complexity of Binary Operations on Regular Languages.- On the State Complexity of the Shu e of Regular Languages.- MSO-definable properties of Muller context-free languages are decidable.- Contextual Array Grammars with Matrix and Regular Control.- Descriptional Complexity of Graph-controlled Insertion-deletion Systems.- Operations on Weakly Recognizing Morphisms.- Descriptional Complexity of Bounded Regular Languages.- The Complexity of Languages Resulting from the Concatenation Operation.- Minimal and Reduced Reversible Automata.

Summary

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. 

Product details

• Assisted by: Cezar Campeanu (Editor), Cezar Câmpeanu (Editor), Flori Manea (Editor), Florin Manea (Editor), Jeffrey Shallit (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.2016
• EAN: 9783319411132
• ISBN: 978-3-31-941113-2
• No. of pages: 217
• Dimensions: 159 mm x 12 mm x 238 mm
• Weight: 365 g
• Illustrations: XVI, 217 p. 50 illus.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > IT; C, Algorithmen und Datenstrukturen, Algorithms, Diskrete Mathematik, Mathematik für Informatiker, computer science, Theory of Computation, Logics and Meanings of Programs, Discrete Mathematics in Computer Science, Discrete Mathematics, Computers, Algorithms & data structures, Computer programming / software engineering, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Formal Languages, Computer architecture & logic design, Computer logic, Computation by Abstract Devices, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory