Introduction to Finite Automata and Regular Expression - Rathinasamy, Kavitha; Duraisamy, Chitra
41,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
21 °P sammeln
  • Broschiertes Buch

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

Andere Kunden interessierten sich auch für
Produktbeschreibung
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
Autorenporträt
I am R. Kavitha, Assistant Professor, Department of CSE, P. A. College of Engineering and Technology, Pollachi, Coimbatore. I received my B.E. Degree in CSE from Madurai Kamaraj University and M.E. degree in CSE from Anna University Chennai. My research interest include image analysis,video processing,compiler design,theory of computation...