Tell your friends about this item:
Introduction to Finite Automata and Regular Expression Kavitha Rathinasamy
Ordered from remote warehouse
Our customers say:
Introduction to Finite Automata and Regular Expression
Kavitha Rathinasamy
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. Finite Automata is characterized into two types Deterministic Finite Automata and Non Deterministic Finite Automata
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | November 29, 2018 |
| ISBN13 | 9786139962051 |
| Publishers | LAP LAMBERT Academic Publishing |
| Pages | 144 |
| Dimensions | 152 × 229 × 9 mm · 233 g |
| Language | English |
See all of Kavitha Rathinasamy ( e.g. Paperback Book )