Trends, Techniques, and Problems in Theoretical Computer Science [electronic resource] : 4th International Meeting of Young Computer Scientists Smolenice, Czechoslovakia, October 13–17, 1986 Selected Contributions / edited by Alica Kelemenová, Jozef Kelemen.

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.