UID:
almafu_9959186232302883
Format:
1 online resource (VIII, 220 p.)
Edition:
1st ed. 1987.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-48008-0
Series Statement:
Lecture Notes in Computer Science, 281
Note:
Bibliographic Level Mode of Issuance: Monograph
,
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.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-18535-6
Language:
English
DOI:
10.1007/3-540-18535-6
URL:
http://dx.doi.org/10.1007/3-540-18535-6
URL:
http://dx.doi.org/10.1007/3-540-18535-6
URL:
http://dx.doi.org/10.1007/3-540-18535-6
