Format:
Online-Ressource (VI, 213 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540480082
Series Statement:
Lecture notes in computer science 281
Content:
Lower bound techniques for VLSI algorithms -- The equivalence of mappings on languages -- Kleene's theorem revisited -- Some combinatorial problems concerning finite languages -- A connection between descriptional complexity of context-free grammars and grammar form theory -- Basic ideas of selective substitution grammars -- Some recent restrictions in the derivation of context-free grammars -- Recent results on the theory of homogeneous structures -- A note on the ratio function in DOL systems -- Models for multicellular development: Characterization, inference and complexity of L-systems -- A formal model of knowledge-based systems -- Basic complexity analysis of hypothesis formation -- Perspectives of logic programming.
Note:
Literaturangaben
Additional Edition:
ISBN 3540185356
Additional Edition:
ISBN 0387185356
Additional Edition:
ISBN 9783540185352
Additional Edition:
Erscheint auch als Druck-Ausgabe Trends, techniques, and problems in theoretical computer science Berlin : Springer, 1987 ISBN 3540185356
Additional Edition:
ISBN 0387185356
Language:
English
Keywords:
Datenverarbeitung
;
Kongress
;
Informatik
;
Theoretische Informatik
;
Datenverarbeitung
;
Informatik
;
Theoretische Informatik
;
Konferenzschrift
DOI:
10.1007/3-540-18535-6
URL:
Volltext
(lizenzpflichtig)
