Scribd
Upload
11 views16 pages

TOC Unit 1

The document discusses the Theory of Computation, focusing on practical applications such as software for digital circuit design, lexical analysis in compilers, and pattern scanning in text. It introduces key concepts including alphabets, strings, and languages, and touches on deterministic finite automata. Additionally, it provides examples and basic principles related to finite automata and formal proofs.

Uploaded by

karthickklr32
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views16 pages

TOC Unit 1

The document discusses the Theory of Computation, focusing on practical applications such as software for digital circuit design, lexical analysis in compilers, and pattern scanning in text. It introduces key concepts including alphabets, strings, and languages, and touches on deterministic finite automata. Additionally, it provides examples and basic principles related to finite automata and formal proofs.

Uploaded by

karthickklr32
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

THEORY OF COMPUTATION

UNIT 1
Real World Example
Use cases

1. Software for designing and checking the behavior of digital circuits .


2. The lexical analyzer of a typical compiler that is the compiler component that
breaks the input text into logical units such as identi ers keywords and
punctuation.
3. Software for scanning large bodies of text such as collections of Web pages
to nd occurrences of words phrases or other patterns
4. Software for verifying systems of all types that have a nite number of distinct
states such as communications protocols or protocols for secure exchange
of information.
Simple Finite Automata
Introduction to Formal Proof
Key Concepts - 1. Alphabets
Finite non-empty set of symbols.
2. Strings - is a finite sequence of symbols chosen
from some alphabet
Powers of an Alphabet
Concatenation of Strings
Languages
Deterministic Finite Automata
Basic Examples
Eg 1 Draw a DFA that accepts all strings from

You might also like