Placeholder text

Go to cart

Introduction to Finite Automata and Regular Expression

By Kavitha Rathinasamy

Introduction to Finite Automata and Regular Expression

By Kavitha Rathinasamy

0 - Default Title
Description
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
Product details
Binding:
Paperback
Number of Pages:
144
Release Date:
2025-11-03
Publication Date:
2025-11-03
Publisher:
LAP LAMBERT Academic Publishing
Languages:
Original: English
ISBN10:
6209198430
ISBN13:
9786209198434
Weight:
233 g
Height:
150 cm
Width:
220 cm
Thickness:
9 cm
Buy on Amazon
Currently sold out