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 /

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.

Bibliographic Details

Main Authors:	Kelemenová, Alica. editor., Kelemen, Jozef. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1987
Subjects:	Computer science., Computers., Mathematical logic., Artificial intelligence., Biomathematics., Statistics., Computer Science., Computation by Abstract Devices., Mathematical Logic and Formal Languages., Artificial Intelligence (incl. Robotics)., Mathematical and Computational Biology., Statistics for Life Sciences, Medicine, Health Sciences.,
Online Access:	http://dx.doi.org/10.1007/3-540-18535-6
Tags:	Add Tag No Tags, Be the first to tag this record!