Staff View for: Descriptional Complexity of Formal Syste

 Staff view

You must be logged in to Tag Records

Descriptional Complexity of Formal Systems [electronic resource] : 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings /

edited by Martin Kutrib, Nelma Moreira, Rogério Reis.

Book Cover
Names: Kutrib, Martin. | Moreira, Nelma. | Reis, Rogério.
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Series: Lecture Notes in Computer Science, 7386
Topics: Computer science. | Logic design. | Computer Science. | Computation by Abstract Devices. | Mathematical Logic and Formal Languages. | Logics and Meanings of Programs.
Tags: Add


Spaces will separate tags.
Use quotes for multi-word tags.


000 03057nam a22005055i 4500
001 15638037
005 20151029222859.0
007 cr nn 008mamaa
008 120709s2012 gw | s |||| 0|eng d
020 |a9783642316234|9978-3-642-31623-4
024 7 |a10.1007/978-3-642-31623-4|2doi
035 |a(DE-He213)978-3-642-31623-4
035 |a(BENdb)444479
040 |dBENdb
050 4|aQA75.5-76.95
072 7|aUYZG|2bicssc
072 7|aCOM037000|2bisacsh
082 04|a004.0151|223
245 10|aDescriptional Complexity of Formal Systems|h[electronic resource] :|b14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings /|cedited by Martin Kutrib, Nelma Moreira, Rogério Reis.
264 1|aBerlin, Heidelberg :|bSpringer Berlin Heidelberg :|bImprint: Springer,|c2012.
300 |aX, 319p. 23 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 ;|v7386
520 |aThis book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012. The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 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|aComputer science.
650 0|aLogic design.
650 14|aComputer Science.
650 24|aComputation by Abstract Devices.
650 24|aMathematical Logic and Formal Languages.
650 24|aLogics and Meanings of Programs.
700 1 |aKutrib, Martin.|eeditor.
700 1 |aMoreira, Nelma.|eeditor.
700 1 |aReis, Rogério.|eeditor.
710 2 |aSpringerLink (Online service)
773 0 |tSpringer eBooks
776 08|iPrinted edition:|z9783642316227
830 0|aLecture Notes in Computer Science,|x0302-9743 ;|v7386
852 80|beitem|hSpringer|t1
856 40|uhttp://libweb.ben.edu/login?source=opac&url=http://dx.doi.org/10.1007/978-3-642-31623-4|yLink to Descriptional Complexity of Formal Systems|z(access limited to Benedictine University patrons)
912 |aZDB-2-SCS
912 |aZDB-2-LNC
950 |aComputer Science (Springer-11645)

Staff View for: Descriptional Complexity of Formal Syste