000 03694nam a22005895i 4500
001 978-3-319-41114-9
003 DE-He213
005 20200421112042.0
007 cr nn 008mamaa
008 160627s2016 gw | s |||| 0|eng d
020 _a9783319411149
_9978-3-319-41114-9
024 7 _a10.1007/978-3-319-41114-9
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aDescriptional Complexity of Formal Systems
_h[electronic resource] :
_b18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings /
_cedited by Cezar C�ampeanu, Florin Manea, Jeffrey Shallit.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXVI, 217 p. 50 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9777
505 0 _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 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.
520 _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 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. .
650 0 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aC�ampeanu, Cezar.
_eeditor.
700 1 _aManea, Florin.
_eeditor.
700 1 _aShallit, Jeffrey.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319411132
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9777
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-41114-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c56673
_d56673