Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Automata (F.1.1...)  
 
Options:
 
  1-10 of 222 Reviews about "Automata (F.1.1...)": Date Reviewed
  Codes and automata
Berstel J., Perrin D., Reutenauer C.,  Cambridge University Press, New York, NY, 2009. 634 pp. Type: Book

Codes and their study are subjects of some standing, particularly the algebraic theory of codes, which is quite well known and finds wide application. This book is a reworking of the now out-of-print Theory of codes [1]. It contains a much ...

Aug 23 2010
  Handbook of weighted automata
Droste M., Kuich W., Vogler H.,  Springer Publishing Company, Incorporated, 2009. 608 pp. Type: Book

The first thing that struck me about this new handbook was its weight. If some of the more distant connections to the topic of weighted automata had been removed, it would have been much handier. This is not to say that the contributions are not...

Jul 20 2010
  Switching and finite automata theory
Kohavi Z., Jha N.,  Cambridge University Press, New York, NY, 2009. 630 pp. Type: Book

This timeless classic is back again with a new edition, 32 years after its last edition [1]. If you intend to study computer engineering, read this book first, then do the hundreds of excellent exercises, and then read the book again. Then,...

Jul 16 2010
  Elements of automata theory
Sakarovitch J., Thomas R. (trans.),  Cambridge University Press, New York, NY, 2009. 785 pp. Type: Book, Reviews: (2 of 2)

Despite its modest title, this book is an extremely comprehensive and well-written analysis of the field. Sakarovitch presents “automata theory as a basic, fundamental subject, known and used by everyone.” Rather than studying...

May 14 2010
  On regular tree languages and deterministic pushdown automata
Janoušek J., Melichar B.  Acta Informatica 46(7): 533-547, 2009. Type: Article

Formal language theory abounds with fascinating relationships between context-free languages (CFLs) and the language-theoretic notion of regularity. For example, Parikh’s theorem maps a CFL to a regular language by ignoring the order of the ...

Mar 17 2010
  Algorithms, languages, automata, and compilers: a practical approach
Mozgovoy M.,  Jones and Bartlett Publishers, Inc., Sudbury, MA, 2009. 300 pp. Type: Book

As the title implies, Mozgovoy ambitiously endeavors to provide both a theoretical and a practical introduction to theoretical computer science (CS)....

Mar 3 2010
  Elements of automata theory
Sakarovitch J., Thomas R. (trans.),  Cambridge University Press, New York, NY, 2009. 785 pp. Type: Book, Reviews: (1 of 2)

Automata are mathematical models of computing machines. As such, they are of central importance in theoretical computer science (CS). The standard discussion of automata deals with finite state machines (FSMs), pushdown automata, Turing machines, ...

Jan 29 2010
  Real-time systems: formal specification and automatic verification
Olderog E., Dierks H.,  Cambridge University Press, New York, NY, 2008. 344 pp. Type: Book

The authors’ stated--and well-achieved--purpose for this advanced and highly focused book on formally specifying and automatically verifying real-time embedded safety-critical systems is to bring together duration calculus (DC),...

Sep 15 2009
  Memory-based state-estimation
Jüngel M., Mellmann H.  Fundamenta Informaticae 85(1-4): 297-311, 2008. Type: Article

State estimation is a process of determining the current state of a complex system by analyzing past observations. It is broadly used in control theory and space technology, providing an effective tool for failure detection and autonomous control ...

Aug 19 2009
  Finite automata and application to cryptography
Tao R.,  Springer Publishing Company, Incorporated, New York, NY, 2009. 350 pp. Type: Book

This is a most welcome and anticipated volume in the fields of automata and cryptography. Tao is a pioneer in the nexus of these two fields. Until now, many results of his research have only been published locally, due to various international...

Jul 13 2009
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com
Terms of Use
| Privacy Policy