LEADER 04163nam 22007215 450 001 996465824503316 005 20230222201930.0 010 $a3-319-41114-4 024 7 $a10.1007/978-3-319-41114-9 035 $a(CKB)3710000000748016 035 $a(DE-He213)978-3-319-41114-9 035 $a(MiAaPQ)EBC6281743 035 $a(MiAaPQ)EBC5596320 035 $a(Au-PeEL)EBL5596320 035 $a(OCoLC)1076254223 035 $a(PPN)194514897 035 $a(EXLCZ)993710000000748016 100 $a20160627d2016 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /$fedited by Cezar Cāmpeanu, Florin Manea, Jeffrey Shallit 205 $a1st ed. 2016. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016. 215 $a1 online resource (XVI, 217 p. 50 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9777 311 $a3-319-41113-6 327 $aCompletely 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. 330 $ahis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9777 606 $aMachine theory 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aMachine theory. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aCāmpeanu$b Cezar$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aManea$b Florin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShallit$b Jeffrey$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465824503316 996 $aDescriptional Complexity of Formal Systems$91904989 997 $aUNISA