04138nam 22007215 450 991048465810332120230222201930.03-319-41114-410.1007/978-3-319-41114-9(CKB)3710000000748016(DE-He213)978-3-319-41114-9(MiAaPQ)EBC6281743(MiAaPQ)EBC5596320(Au-PeEL)EBL5596320(OCoLC)1076254223(PPN)194514897(EXLCZ)99371000000074801620160627d2016 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierDescriptional 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 Shallit1st ed. 2016.Cham :Springer International Publishing :Imprint: Springer,2016.1 online resource (XVI, 217 p. 50 illus.) Theoretical Computer Science and General Issues,2512-2029 ;97773-319-41113-6 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.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. .Theoretical Computer Science and General Issues,2512-2029 ;9777Machine theoryComputer scienceAlgorithmsComputer science—MathematicsDiscrete mathematicsFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingTheory of ComputationAlgorithmsDiscrete Mathematics in Computer ScienceMachine theory.Computer science.Algorithms.Computer science—Mathematics.Discrete mathematics.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Theory of Computation.Algorithms.Discrete Mathematics in Computer Science.004.0151Câmpeanu Cezaredthttp://id.loc.gov/vocabulary/relators/edtManea Florinedthttp://id.loc.gov/vocabulary/relators/edtShallit Jeffreyedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910484658103321Descriptional Complexity of Formal Systems1904989UNINA