Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Finite Automata, Their Algebras and Grammars by J. R. Büchi (1989, Hardcover)
C
CH Media Store (7717)
99.9% positive feedback
Price:
US $12.01
ApproximatelyRM 49.66
+ $22.58 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherSpringer
ISBN-100387969055
ISBN-139780387969053
eBay Product ID (ePID)1316322
Product Key Features
Number of PagesXxii, 316 Pages
Publication NameFinite Automata, Their Algebras and Grammars
LanguageEnglish
Publication Year1989
SubjectMachine Theory, Counting & Numeration, Logic, Robotics
TypeTextbook
Subject AreaMathematics, Computers, Technology & Engineering
AuthorJ. R. Büchi
FormatHardcover
Dimensions
Item Weight22.6 Oz
Additional Product Features
Intended AudienceScholarly & Professional
LCCN88-037420
Dewey Edition19
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal511
SynopsisThe author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert., The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Buchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert."
LC Classification NumberQA71-90TJ210.2-211.
Be the first to write a review
