Finite Automata

Is L=Language(ab*) and L=language(ab)* are equal ?

• Yes

• No

• may be

• I do not know

A 5 –tuple of DFA 

• (Q, ε, d, q0,F)

• (q, ∑, d, q0,F)

• (Q, ∑, δ, q0,F),

• (Q, ε, λ, q0,F)

we define finite automaton by a 5 –tuple (Q, ∑,δ, q0,F), where Q stands for

• Quotient

• a finite set of states

• Final state

• None

We define finite automaton by a 5 –tuple (Q, ∑, δ, q0,F), where ∑

• Summation

• symbols

• List of symbols

• Finite set of input alphabets

We define finite automaton by a 5 –tuple (Q, ∑, δ, q₀ ,F), where δ

• Transition function  mapping Q X ∑ to F

• Transition function  mapping Q X ∑ to q₀

• Transition function  mapping Q X ∑ to Q

• None

We define finite automaton by a 5 –tuple (Q, ∑, δ, q₀,F)

where q₀

• States

• Start State

• Final State

• Final states

We define finite automaton by a 5 –tuple (Q, ∑, δ, q₀,F)

where F

• Final state

• Final States

• All states

• Empty satae

A string is accepted by Finite Automata

• The FA accepts a string, if it reaches the final state. The language accepted by a FA is denoted as L(M).

• L(M) = { w | ﮤ (q0, w) is in F}

• L(M)  is the set of all words over an alphabet , which starts from start state and reaches the final state.

• All the above

Difference between δ and δ cap.

• Both are same

• δ is used to process a string and δ cap is used to process a character

• δ is used to process a string and δ cap is used to process a string

• δ is used to process a caharacter and δ cap is used to process a string

Start state and final state are

• Start state - q₀

  Final state _- q₀

• Start state - q₀

  Final state _- q₁

• Start state - q₁

  Final state _- q₀

• Start state - q₃

  Final state _- q₁