Descriptional Complexity of Formal Systems

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

Cezar Câmpeanu, Florin Manea, Jeffrey Shallit (Herausgeber)

Buch | Softcover

XVI, 217 Seiten

2016 | 1st ed. 2016
Springer International Publishing (Verlag)
978-3-319-41113-2 (ISBN)

Artikel merken

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.

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.

Erscheinungsdatum	08.10.2016
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVI, 217 p. 50 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik
Schlagworte	Applications • Automata extensions • Automata Theory • computational completeness • Computer Science • conference proceedings • context free languages • descriptional complexity measures • deterministic finite automaton • Formal Languages • Grammars • graph-controlled systems • Informatics • Information Theory • insertion-deletion systems • Mathematical logic and formal languages • Models of Computation • quantitative automata • quantum complexity theory • regular languages • Research • State Complexity • syntactic complexity • Theory of Computation • Turing Machines • unrestricted complexity
ISBN-10	3-319-41113-6 / 3319411136
ISBN-13	978-3-319-41113-2 / 9783319411132
Zustand	Neuware