Kelemenova

Trends, Techniques, and Problems in Theoretical Computer Science

4th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, October 13-17, 1986
Mitarbeit:Kelemenová, Alica; Kelemen, Jozef

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 281
• Verlag: Springer, Berlin
• 1981.
• Seitenzahl: 228
• Erscheinungstermin: 21. Oktober 1987
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 370g
• ISBN-13: 9783540185352
• ISBN-10: 3540185356
• Artikelnr.: 09236091

Inhaltsangabe

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.