About this document

Introduction to Automata Theory by Pradeep is a document available to read on EtoBox.

This document discusses formal language theory and mathematical models of computation. It introduces deterministic finite automata (DFAs) as a model of computation. A DFA is defined as a 5-tuple (Q, Σ, δ, q0, F) where Q is a finite set of states, Σ is a finite alphabet, δ is the transition function, q0 is the starting state, and F is the set of accepting states. The document proves that the union and intersection of two regular languages recognized by DFAs are also regular languages.

Author

Pradeep

Language

EN