Descriptional Complexity of Formal Systems 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings /

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions....

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Holzer, Markus (Επιμελητής έκδοσης), Kutrib, Martin (Επιμελητής έκδοσης), Pighizzini, Giovanni (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Σειρά:Lecture Notes in Computer Science, 6808
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03040nam a22005295i 4500
001 978-3-642-22600-7
003 DE-He213
005 20161227153638.0
007 cr nn 008mamaa
008 110720s2011 gw | s |||| 0|eng d
020 |a 9783642226007  |9 978-3-642-22600-7 
024 7 |a 10.1007/978-3-642-22600-7  |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 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings /  |c edited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a X, 329 p. 59 illus., 1 illus. in color.  |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 6808 
520 |a This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computers. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Software Engineering. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Logics and Meanings of Programs. 
700 1 |a Holzer, Markus.  |e editor. 
700 1 |a Kutrib, Martin.  |e editor. 
700 1 |a Pighizzini, Giovanni.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642225994 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6808 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-22600-7  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)