This volume presents research results ranging from those in pure mathematical theory (semigroup theory, graph theory, etc.) to those in theoretical and applied computer science, e.g. formal languages, automata, codes, parallel and distributed computing, formal systems, knowledge systems and database theory.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
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)
metacirculant graphs, positive boolean dependencies, maximal solid codes, commutative stabilizers, interlaced product, largest weighted edge, table transition automaton, tolerance rough set model, infix base, simple group whose order, directable automaton, subword order, cases above holds, infix codes, directable automata, partial function type, random spanning tree, node unmarked, weak monotonous, circuit value problem, directing words, coherent subsets, unavoidable set, nondeterministic automaton, right congruence Key Phrases - Capitalized Phrases (CAPs): (learn more)
Wujie Shi, New York, Computer Science, Lecture Notes, Academic Press, Ngo Dac Tan, Proof Let, Acta Math, Mac Naughton, Southwest-China Normal Univ, Cambridge University Press, London Math New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
metacirculant graphs, positive boolean dependencies, maximal solid codes, commutative stabilizers, interlaced product, largest weighted edge, table transition automaton, tolerance rough set model, infix base, simple group whose order, directable automaton, subword order, cases above holds, infix codes, directable automata, partial function type, random spanning tree, node unmarked, weak monotonous, circuit value problem, directing words, coherent subsets, unavoidable set, nondeterministic automaton, right congruence Key Phrases - Capitalized Phrases (CAPs): (learn more)
Wujie Shi, New York, Computer Science, Lecture Notes, Academic Press, Ngo Dac Tan, Proof Let, Acta Math, Mac Naughton, Southwest-China Normal Univ, Cambridge University Press, London Math New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 14
books:
See all 14 books this book cites
- Formal Concept Analysis: Mathematical Foundations by Bernhard Ganter on page 52
- Machine Learning: An Artificial Intelligence Approach (Volume I) by Ryszard S. Michalski on page 53
- Foundations of Statistical Natural Language Processing by Christopher D. Manning on page 53
- Possibility Theory by Didier Dubois on page 140
- Data Mining by Jiawei Han on page 140
See all 14 books this book cites
Books on Related Topics
(learn more)
|
|
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
|
