Descriptional Complexity of Formal Systems 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings /

This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the f...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Jürgensen, Helmut (Επιμελητής έκδοσης), Karhumäki, Juhani (Επιμελητής έκδοσης), Okhotin, Alexander (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2014.
Σειρά:Lecture Notes in Computer Science, 8614
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03928nam a22005655i 4500
001 978-3-319-09704-6
003 DE-He213
005 20151103125318.0
007 cr nn 008mamaa
008 140711s2014 gw | s |||| 0|eng d
020 |a 9783319097046  |9 978-3-319-09704-6 
024 7 |a 10.1007/978-3-319-09704-6  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UYZG  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Descriptional Complexity of Formal Systems  |h [electronic resource] :  |b 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings /  |c edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XII, 366 p. 59 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 8614 
505 0 |a Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of objects, state explosion-like phenomena -- Circuit complexity of Boolean functions and related measures -- Resource-bounded or structure-bounded environments -- Frontiers between decidability and undecidability -- Universality and reversibility -- Structural complexity -- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages) -- Nature-motivated (bio-inspired) architectures and unconventional models of computing -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. 
520 |a This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of objects, state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; complexity aspects of combinatorics on words; Kolmogorov complexity. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Jürgensen, Helmut.  |e editor. 
700 1 |a Karhumäki, Juhani.  |e editor. 
700 1 |a Okhotin, Alexander.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319097039 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 8614 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-09704-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)