Hopcroft  | Pearson

48,000원  | 20131203  | 9781292039053

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.

Hromkovic, Juraj  | Springer

178,180원  | 20031101  | 9783540140153

Linz, Peter  | Jones&Bartlett Learning

49,000원  | 20160301  | 9781284077247

An Introduction to Formal Languages and Automata, Sixth Edition provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text is designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. The author, Peter Linz, continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail allowing students to focus on and understand the key underlying principles. New & Key Features: ? An accessible approach allows students to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the course ? New Chapter Synopsis, found at the end of each chapter, recap important concepts found in the text ? Every major idea is preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness ? The exercise section has been restructured and improved with accessible exercises more closely tied to examples in the text ? An enhanced Instructor's Manual includes more detailed solutions to problems found in the text

 | LAP Lambert Academic Publishing

114,420원  | 20181129  | 9786139962051

A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input. Regular Languages are the most restricted types of languages and are accepted by finite automata. A language is regular if it can be expressed in terms of regular expression, Finite automata.

Levelt, W. J. M.  | John Benjamins

0원  | 20081015  | 9789027232502

The present text is a re-edition of Volume I of Formal Grammars in Linguistics and Psycholinguistics, a three-volume work published in 1974. It is an entirely self-contained still relevant introduction to the theory of formal grammars and automata.

 | Springer

49,180원  | 20210927  | 9783030769079

Computation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) steps following a specific set of rules (an algorithm).