Descriptional Complexity of Formal Systems
18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
Published on 28. June 2016
Book
Paperback/Softback
XVI, 217 pages
978-3-319-41113-2 (ISBN)
Description
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.
More details
Series
Edition
1st ed. 2016
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
50 s/w Abbildungen
XVI, 217 p. 50 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 13 mm
Weight
365 gr
ISBN-13
978-3-319-41113-2 (9783319411132)
DOI
10.1007/978-3-319-41114-9
Schweitzer Classification
Other editions
Additional editions
Cezar Câmpeanu | Florin Manea | Jeffrey Shallit
Descriptional Complexity of Formal Systems
18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
E-Book
07/2016
Springer
€53.49
Available for download
Content
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.