Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)
Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)
Resource Information
The item Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 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.
 Language
 eng
 Extent
 XVI, 217 p. 50 illus.
 Contents

 Completely Reachable Automata
 Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy
 Heapability, interactive particle systems, partial orders: results and open problems
 SelfVerifying 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
 MSOdefinable properties of Muller contextfree languages are decidable
 Contextual Array Grammars with Matrix and Regular Control
 Descriptional Complexity of Graphcontrolled Insertiondeletion 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
 Isbn
 9783319411149
 Label
 Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings
 Title
 Descriptional Complexity of Formal Systems
 Title remainder
 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings
 Statement of responsibility
 edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit
 Subject

 Computation by Abstract Devices
 Computers
 Computer science
 Algorithms
 Algorithm Analysis and Problem Complexity
 Logic, Symbolic and mathematical
 Mathematical Logic and Formal Languages
 Computer Science
 Computer Science
 Computer science  Mathematics
 Logic, Symbolic and mathematical
 Discrete Mathematics in Computer Science
 Logic, Symbolic and mathematical
 Computer logic
 Electronic resources
 Computer science
 Algorithms
 Computer logic
 Computer science  Mathematics
 Logics and Meanings of Programs
 Computers
 Algorithms
 Computers
 Computer Science
 Computer science
 Computer science  Mathematics
 Computer logic
 Language
 eng
 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.
 Image bit depth
 0
 LC call number
 QA8.9QA10.3
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Câmpeanu, Cezar
 Manea, Florin.
 Shallit, Jeffrey.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 9777
 http://library.link/vocab/subjectName

 Computer science
 Computers
 Algorithms
 Computer logic
 Logic, Symbolic and mathematical
 Computer science
 Computer Science
 Mathematical Logic and Formal Languages
 Logics and Meanings of Programs
 Computation by Abstract Devices
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Label
 Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Completely Reachable Automata  Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy  Heapability, interactive particle systems, partial orders: results and open problems  SelfVerifying 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  MSOdefinable properties of Muller contextfree languages are decidable  Contextual Array Grammars with Matrix and Regular Control  Descriptional Complexity of Graphcontrolled Insertiondeletion 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
 Dimensions
 unknown
 Extent
 XVI, 217 p. 50 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319411149
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319411149
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319411149
 Label
 Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Completely Reachable Automata  Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy  Heapability, interactive particle systems, partial orders: results and open problems  SelfVerifying 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  MSOdefinable properties of Muller contextfree languages are decidable  Contextual Array Grammars with Matrix and Regular Control  Descriptional Complexity of Graphcontrolled Insertiondeletion 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
 Dimensions
 unknown
 Extent
 XVI, 217 p. 50 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319411149
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319411149
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319411149
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Algorithms
 Algorithms
 Computation by Abstract Devices
 Computer Science
 Computer Science
 Computer Science
 Computer logic
 Computer logic
 Computer logic
 Computer science
 Computer science
 Computer science
 Computer science  Mathematics
 Computer science  Mathematics
 Computer science  Mathematics
 Computers
 Computers
 Computers
 Discrete Mathematics in Computer Science
 Electronic resources
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical
 Logics and Meanings of Programs
 Mathematical Logic and Formal Languages
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/DescriptionalComplexityofFormalSystems18th/rAgcpJjBca4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/DescriptionalComplexityofFormalSystems18th/rAgcpJjBca4/">Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/DescriptionalComplexityofFormalSystems18th/rAgcpJjBca4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/DescriptionalComplexityofFormalSystems18th/rAgcpJjBca4/">Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 58, 2016. Proceedings, edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>