UID:
almahu_9947920856702882
Umfang:
VIII, 220 p.
,
online resource.
ISBN:
9783540480082
Serie:
Lecture Notes in Computer Science, 281
Anmerkung:
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.
In:
Springer eBooks
Weitere Ausg.:
Printed edition: ISBN 9783540185352
Sprache:
Englisch
DOI:
10.1007/3-540-18535-6
URL:
http://dx.doi.org/10.1007/3-540-18535-6
