1 option
Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9777
- Theoretical Computer Science and General Issues, 2512-2029 ; 9777
- Language:
- English
- Subjects (All):
- Machine theory.
- Computer science.
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Formal Languages and Automata Theory.
- Computer Science Logic and Foundations of Programming.
- Theory of Computation.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Formal Languages and Automata Theory.
- Computer Science Logic and Foundations of Programming.
- Theory of Computation.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XVI, 217 pages) : 50 illustrations
- Edition:
- 1st ed. 2016.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- 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. .
- 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 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-41114-9
- 9783319411149
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.