This volume contains the texts of the tutorial lecture, five invited lectures and twenty short communications contributed for presentation at the Sixth International Meeting of Young Computer Scientists, IMYCS '90. The aim of these meetings is threefold: (1) to inform on newest trends, results, and problems in theoretical computer science and related fields through a tutorial and invited lectures delivered by internationally distinguished speakers, (2) to provide a possibility for beginners in scientific work to present and discuss their results, and (3) to create an adequate opportunity for establishing first professional relations among the participants.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
chaos game algorithm, conjugate gradient methods, iterative function systems, maximum constant degree, order reachability problem, subpicture problem, rational monoids, probabilistic finite generators, formula permut, alternating grammars, refutation dag, regular chain code picture languages, symmetric neural networks, higher type primitive recursive definitions, ground rewrite systems, expression tree evaluation, subsequential functions, insensitivity range, ground tree transducers, subsequential transducer, minimal transducer, oracle hierarchy, recognizable tree languages, distributed termination problem, affine automata Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science, Machine Learning, Academic Press, New York, Artificial Intelligence, Lecture Notes, Technical Report, University of Texas, Springer Verlag, Morgan Kaufmann, Theorem Let, North Holland, Chinese Remainder Theorem, Comenius University, Logics of Programs, Examples of Images Generated, Expert Systems, Sierpinski Triangle, Cognitive Science, Notes Comp, Computational Geometry, The Boltzmann, Université Paris Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
chaos game algorithm, conjugate gradient methods, iterative function systems, maximum constant degree, order reachability problem, subpicture problem, rational monoids, probabilistic finite generators, formula permut, alternating grammars, refutation dag, regular chain code picture languages, symmetric neural networks, higher type primitive recursive definitions, ground rewrite systems, expression tree evaluation, subsequential functions, insensitivity range, ground tree transducers, subsequential transducer, minimal transducer, oracle hierarchy, recognizable tree languages, distributed termination problem, affine automata Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science, Machine Learning, Academic Press, New York, Artificial Intelligence, Lecture Notes, Technical Report, University of Texas, Springer Verlag, Morgan Kaufmann, Theorem Let, North Holland, Chinese Remainder Theorem, Comenius University, Logics of Programs, Examples of Images Generated, Expert Systems, Sierpinski Triangle, Cognitive Science, Notes Comp, Computational Geometry, The Boltzmann, Université Paris Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
