Skip to main content

Featured

Skillset, topics, projects and virtual internships for DS

This post is for those who are beginner and do not have any idea about topics that they need as a beginner DATA SCIENCE/ DATA ANALYST.  I am also facing the same problem before a year ago and till date I have some relevant knowledge about data science and also have some projects.  People are saying the we need so many skills like Mathematics, Programming language, some cloud concepts too. Actually they are right. Being a Data Scientist is not like being a web developer or a front-end developer that have limited skill set.  In this post I will tell you the exact topics that you need to learn at beginner level. MATHEMATICS Descriptive Statistics, distributions, hypothesis testing and regression analysis. Bayesian Thinking, conditional probability, priors, maximum likely hood. Vectors and matrices Matrices operations Eigenvalues and eigenvectors Linear and non linear functions Multivariable calculus  PROGRAMMING LANGUAGE(Python or R)    Data types, String operations, Expressions and varia
Post a Comment
Read more

Difference between DFA and NDFA | Automata | Theory of computation

What are DFA and NDFA ?
What are the major differences between DFA and NDFA?
Which one is more powerful?
Examples




DFA is acronym of deterministic finite automata and it is subpart of finite automata. 

Definition of DFA
A deterministic finite automata can be defined with the help of 5 tuples(signatures).
That are Σ ,δ, q0 ,Q , F.
where 
  Σ = set of inputs / alphabets
  δ = transition function  ( Σ × Q = Q )
  q0 = initial state  Q = set of states 
  F = set of final states

Definition of NDFA 

 A non deterministic finite automata can be defined with the help of following 5 tuples.
i.e; Σ ,δ, q0 ,Q , F.
where
  Σ = set of inputs / alphabets
  δ = transition function  ( Σ × Q = 2^Q )
  "here transition function is in the form subsets.
  and 2^Q showing for single input symbol , there will be multiple output or states."
  q0 = initial state
  Q = set of states 
  F = set of final states

Difference between DFA and NDFA

  1. In DFA there is a single output state for a single input but in the case of NDFA there is multiple output for single input.
  2. DFA is more complex to construct in the comparison of NDFA.
  3. NDFA is more powerful in the comparison of DFA.
  4. NDFA is less efficient in the comparison of DFA.
Figures

  In this figure, q0 is initial state and here a and b are inputs and qf is final state.
so on 'a' inputs we have single output state i.e; qf.
so this is DFA.
In this figure, q0 is initial state and here a is input and qf is final state.
so on 'a' inputs we have multiple output states i.e; q0 and qf.
so this is NDFA.













Both DFA and NDFA is the part of finite automata.


If have some doubts feel free to connect.
https://www.instagram.com/kavyansh.pandey


Thanking you.

Comments

Post a Comment

Popular Posts