Scribd
Upload
33 views

Unit 1

This document discusses automata theory and finite automata. It defines key concepts like finite automata, states, transitions, symbols, alphabets, strings, languages, deterministic finite automata (DFA), and non-deterministic finite automata (NFA). It explains that finite automata are used to recognize patterns in strings and can accept or reject inputs. The pumping lemma is discussed as a method to check if a language is regular or not based on the ability to "pump" strings in the language.

Uploaded by

hejoj76652
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
33 views

Unit 1

This document discusses automata theory and finite automata. It defines key concepts like finite automata, states, transitions, symbols, alphabets, strings, languages, deterministic finite automata (DFA), and non-deterministic finite automata (NFA). It explains that finite automata are used to recognize patterns in strings and can accept or reject inputs. The pumping lemma is discussed as a method to check if a language is regular or not based on the ability to "pump" strings in the language.

Uploaded by

hejoj76652
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/ 17

Automata theory (also known as Theory Of Computation)

is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of
computation with respect to simple machines, referred to as automata.

An automaton with a finite number of states is called a Finite automaton.

Before learning Automata, you should have a basic understanding of string, language,
alphabets, symbols.

This automaton consists of states and transitions. The State is represented by circles, and
the Transitions is represented by arrows.

Symbols:
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”.

Symbols are an entity or individual objects, which can be any letter, alphabet or any picture.

Example : 1, a, b, #

Alphabets:

Alphabets are a finite set of symbols. It is denoted by ∑.

Examples:

1. ∑ = {a, b}
2. ∑ = {A, B, C, D}
3. ∑ = {0, 1, 2}
4. ∑ = {0, 1, ....., 5]
5. ∑ = {#, β, Δ}

String:
It is a finite collection of symbols from the alphabet. The string is denoted by w.

Example 1:

If ∑ = {a, b}, various string that can be generated from ∑ are {ab, aa, aaa, bb, bbb, ba, aba. ... }.

o A string with zero occurrences of symbols is known as an empty string. It is represented by ε.


o The number of symbols in a string w is called the length of a string. It is denoted by |w|.

Example 2:

1. w = 010
2. Number of Sting |w| = 3

Language:

A language is a collection of appropriate string. A language which is formed over Σ can


be Finite or Infinite.

Example: 1

L1 = {Set of string of length 2}

= {aa, bb, ba, bb} Finite Language

Example: 2

L2 = {Set of all strings starts with 'a'}or any string that starts with a
and ends with a.

= {a, aa, aaa, abb, abbb, ababb} Infinite Language

∑𝟎 = ∈

LAG: Language, Automata, grammer.

Finite Automata
o Finite automata are used to recognize patterns.

o It takes the string of symbol as input and changes its state accordingly. When the desired
symbol is found, then the transition occurs.

o At the time of transition, the automata can either move to the next state or stay in the same
state.

o Finite automata have two states, Accept state or Reject state. When the input string is
processed successfully, and the automata reached its final state, then it will accept.
we can say that it is a model, machine that is used to recognized whether the string comes under the
language or not.(Automata)

A finite automaton is a collection of 5-tuple (Q, ∑, δ, q0, F), where:

1. Q: finite set of states


2. ∑: finite set of the input symbol
3. q0: initial state
4. F: final state
5. δ: Transition function

Types of Automata:
There are two types of finite automata:

1. DFA(deterministic finite automata)


2. NFA(non-deterministic finite automata)

1. DFA
2. NFA
Some important points about DFA and NFA:

1. Every DFA is NFA, but NFA is not DFA.

2. There can be multiple final states in both NFA and DFA.

3. DFA is used in Lexical Analysis in Compiler.

4. NFA is more of a theoretical concept.


Clean clouser : it is a set of all string of all length possible of a,b .

Clean clouser = infinite language .

Clean positive : set of all string possible but not epsilon i.e sigma^0.

Pumping lemma : one of the method is used to check whether the language us regular or not(arises in case of
infinite type) it is a negative test .

What is the pumping lemma for regular languages, and what does it imply about the nature
of such languages?

The Pumping Lemma for regular languages is a fundamental theorem

After pumping y if that string comes under the language that means test passed and it is undecidable whether it
is regular or not
if string after pumping not comes under the language then test failed and it will going to be a non regular
language.

If L is a regular language
What the Pumping Lemma implies about the nature of regular languages:

Regular languages are closed under concatenation

Regular languages are closed under union

Regular languages are closed under intersection

Regular languages are closed under complement

Discuss the significance of the pumping length in the pumping lemma.


Proof of Non-Regularity:

Understanding Regular Languages:

Closure Properties:

Complexity Analysis

Describe the state elimination method to convert a DFA to a regular expression. Provide a step-by-step
process for converting a DFA to a regular expression.

State elimination method is used to simplify and minimize finite automata while preserving
their language recognition capabilities. This method is commonly used to convert a non-
deterministic finite automaton (NFA) into a deterministic finite automaton

You might also like