Descriptional Complexity of Formal Systems (Record no. 56673)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03694nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-41114-9 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421112042.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160627s2016 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319411149 |
| -- | 978-3-319-41114-9 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.131 |
| 245 10 - TITLE STATEMENT | |
| Title | Descriptional Complexity of Formal Systems |
| Sub Title | 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XVI, 217 p. 50 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. . |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 700 1# - AUTHOR 2 | |
| Author 2 | C�ampeanu, Cezar. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Manea, Florin. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Shallit, Jeffrey. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-41114-9 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics in Computer Science. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.