You all know what is Finite Automata now. The process is divided into two types, Deterministic Finite Automata Non Deterministic Finite Automata So in this post, we’ll know the basics of what a deterministic finite automata is, This DFA (Deterministic Finite Automata) process is defined by 5 tuples, (Q, Σ, δ, q, F) Looks complex …

 

As I mentioned in the previous article I will explain finite automata in little details in next article and this is the next article I was talking about. In previous article you guys learned about the hierarchy of TOC. So, What Is Finite Automata? Let’s take an example, We have a collection of alphabets as …

 

Well, I’m a computer science engineer like you. Who is not interested to study at university. But I have exams coming soon. That’s why I have to study this subject. So I thought why should I only waste time in exams, when I can write about what I know in my blogs and increase my …

Updating…
  • No products in the cart.