-
Anglický jazyk
Introduction to Finite Automata and Regular Expression
Autor: 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... Viac o knihe
Na objednávku
56.06 €
bežná cena: 63.70 €
O knihe
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
- Vydavateľstvo: LAP LAMBERT Academic Publishing
- Rok vydania: 2018
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786139962051
