Trends, techniques, and problems in theoretical computer science : 4th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, October 13-17, 1986 : selected contributions

Alica Kelemenová, Jozef Kelemen (eds.)

[目次]

  • 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.

「Nielsen BookData」より

この本の情報

書名 Trends, techniques, and problems in theoretical computer science : 4th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, October 13-17, 1986 : selected contributions
著作者等 International Meeting of Young Computer Scientists
Kelemen, Jozef
Kelemenová, Alica
Kelemenova Alica
シリーズ名 Lecture notes in computer science
出版元 Springer-Verlag
刊行年月 c1987
ページ数 vi, 213 p.
大きさ 25 cm
ISBN 0387185356
3540185356
NCID BA01241695
※クリックでCiNii Booksを表示
言語 英語
出版国 ドイツ
この本を: 
このエントリーをはてなブックマークに追加

Yahoo!ブックマークに登録
この記事をクリップ!
Clip to Evernote
このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想