Descriptional Complexity of Formal Systems (Record no. 55978)

000 -LEADER
fixed length control field 03438nam a22005535i 4500
001 - CONTROL NUMBER
control field 978-3-642-39310-5
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421111849.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 130615s2013 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783642393105
-- 978-3-642-39310-5
082 04 - CLASSIFICATION NUMBER
Call Number 004.0151
245 10 - TITLE STATEMENT
Title Descriptional Complexity of Formal Systems
Sub Title 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings /
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 289 p. 56 illus.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. The 22 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 46 submissions. The topics covered are automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems; succinctness of description of objects, state-explosion-like phenomena; circuit complexity of Boolean functions and related measures; size complexity and structural complexity of formal systems; trade-offs between computational models and mode of operation; applications of formal systems; for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages; and their complexity constraints; size or structural complexity of formal systems for modeling natural languages; complexity aspects related to the combinatorics of words; descriptional complexity in resource-bounded or structure-bounded environments; structural complexity as related to descriptional complexity; frontiers between decidability and undecidability; universality and reversibility; nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov-Chaitin complexity, algorithmic information.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Jurgensen, Helmut.
700 1# - AUTHOR 2
Author 2 Reis, Rog�erio.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-39310-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2013.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- 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
-- Computation by Abstract Devices.
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
-- 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.