Scribd
Upload
15 views2 pages

TOC - Module 1

Theory of Computation

Uploaded by

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

TOC - Module 1

Theory of Computation

Uploaded by

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

Om Sai

Ro

Theory of Computation

Input -- Abstract Machine / Model - Output

One state to other state

Abstract Machine / Model  Automata (Low level implementation)


Implemented within a finite number of states  Finite Automata

Applications:

 Design of Compiler Lexical Analyzer (Rules  Compiler error)


 Pattern matching Password rules
 Spell check  MS Word

Valid or Invalid

Automata covers 3 Concepts:


 Automata (i/p  o/p)
 Computability (Ability of computing)
 Complexity (optimal solution)

Basic Terminologies of Theory of Computation:


Symbols:
Is a smallest building block, which can be of alphabet, letter or picture

Alphabets Σ

String = w
Length = |w|
No of strings = |w|n

Positive Closure:
+
All values except NULL = L

Kleene Star/Kleene Closure


*
All values including NULL = L

Language:
A language is a set of strings, chosen from some Σ* or we can say- ‘A language is a
subset of Σ* ‘. A language that can be formed over ‘ Σ ‘ can be Finite or Infinite.

Example of Finite Language:


L1 = { set of string of 2 }
L1 = { xy, yx, xx, yy }
Example of Infinite Language:
L1 = { set of all strings starts with 'b' }
L1 = { babb, baa, ba, bbb, baab, ....... }

You might also like