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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Câmpeanu, Cezar (Επιμελητής έκδοσης), Manea, Florin (Επιμελητής έκδοσης), Shallit, Jeffrey (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
• Σειρά: Lecture Notes in Computer Science, 9777
• Θέματα: Computer science.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.

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

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

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