Scribd
Upload
22 views

Intro To Toc

Uploaded by

Rohan Valia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views

Intro To Toc

Uploaded by

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

What is TOC?

The Theory of computation is the branch that deals with whether and how
efficiently problems can be solved on a model of computation, using an
algorithm.
The field is divided into three major branches:
1.Automata theory,
2.Computability theory
3. Computational complexity theory.
• In theoretical computer science, Automata theory is the study of
abstract machines (or more appropriately, abstract 'mathematical'
machines or systems) and the computational problems that can be
solved using these machines.
• This automaton consists of
• • states (represented in the figure by circles),
• • and transitions (represented by arrows).
• As the automaton sees a symbol of input, it makes a transition (or
jump) to another state, according to its transition function (which
takes the current state and the recent symbol as itsinputs).
• Uses of Automata: compiler design and parsing.
• Automata enables scientists to understand how machines compute
the functions and solve problems. The main motivation behind
developing Automata Theory was to develop methods to describe and
analyze the dynamic behavior of discrete systems. 
• Automata originated from the word “Automaton” which is closely
related to “Automation”.
BASICS OF STRINGS AND ALPHABETS
• SET: A SET IS A WELL DEFINED COLLECTION OF OBJECTS.

OPERATIONS ON SET:
1. UNION
2. INTERSECTION
3. COMPLEMENT
4. REVERSAL
• Symbols :
• Symbols are indivisible objects or entity that cannot be defined. That is,
symbols are the atoms of the world of languages. A symbol is any single
object such as , a, 0, 1, #,begin, or do.
• Alphabets :
• An alphabet is a finite, nonempty set of symbols. The alphabet of a
language is normally denoted by ∑.
• Strings or Words over Alphabet :
• A string or word over an alphabet ∑ is a finite sequence of concatenated
symbols of ∑
Example : 0110, 11, 001 are three strings over the binary alphabet { 0,
1 } . OR aab, abcb, b, cc are four strings over the alphabet { a, b, c }.

• Length of a string :
The number of symbols in a string w is called its length, denoted by |
w|.
Example : | 011 | = 3, |11| = 2, | b | = 1
SOME STRING OPERATIONS:

• CONCATENATION
• TRANSPOSE – Palindrome
• PREFIX
• SUFFIX
• SUBSTRING
Closure Representation in TOC:
• L+: It is a Positive Closure that represents a set of all strings except
Null or ε-strings.
• L*: It is “Kleene Closure“, that represents the occurrence of certain
alphabets for given language alphabets from zero to the infinite
number of times. In which ε-string is also included.
RELATIONS AND FUNCTIONS

• Cartesian product of Sets


• Let’s assume A and B to be two non-empty sets, the sets of all
ordered pairs (x, y) where x∈A and y∈B is called a Cartesian product
of the sets.
A × B = {x, y | x∈A and y∈B}
Question: Find the cartesian products of set A ={1,2,3} and B={3,4,5}. 
• Following the above definition, let Cartesian product be X, 
----X = A x B 
•    = {(1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,3), (3,4), (3,5)}
• Let |A| and |B| be the number of elements in set A and set B
respectively. Let the number of elements in Cartesian product of the
two sets be |X|. Then, 
REPRESENTATION - |X| = |A| x |B|
• Relation
• A relation from set A to set B is a subset of the cartesian product set A
x B. The subset is made up by describing a relationship between the
first element and the second element of elements in A x B. 
• Function
• A function is a special kind of relation. It is a relation in which each
domain value maps only to one range value. It is denoted by ƒ:X⇒Y.
What this means that it is a function from X to Y. It takes input from
set X and gives the unique value from set Y as output. “X” is called the
domain of the function while “Y” is called the co-domain. 

You might also like