Descriptional Complexity of Formal Systems

18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings

AvCezar Câmpeanu,Florin Manea

Häftad, Engelska, 2016

Del 9777 i serien Lecture Notes in Computer Science

549 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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 ﬁeld in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, ﬁnte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

Produktinformation

Utgivningsdatum:2016-06-28
Mått:155 x 235 x 13 mm
Vikt:365 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:217
Förlag:Springer International Publishing AG
ISBN:9783319411132

Utforska kategorier

Innehållsförteckning

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-deﬁnable 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.