'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Contests & Events
Problem of the day
Coding Ninjas Studio
Theory of Computation
Basics of TOC
Last updated: Mar 10, 2022
Basics of TOC
In this blog series, we’ll learn about different basic concepts of Theory of Computation such as Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA), Myhill Nerode Theorem, Conversions, Finite State Machine, and much more.
Introduction to Automata
In this article, we will explore the world of Automata, how automata perform tasks in a wide range of devices and machines available worldwide.
Introduction of Automata Theory
This article will cover the introduction of automata theory.
Finite State Machine
This article will discuss the Finite State Machine along with Deterministic and Non Deterministic finite automata in detail.
Deterministic Finite Automata or DFA
In this blog, we will discuss Finite Automata, its formal definition, its types, Deterministic Finite Automata, its formal definition, needs, and examples
Non-Deterministic Finite Automata
In this blog, we will go through Non-Deterministic Finite Automata, its need, in which condition any string is accepted by an NFA, and the major differences between NFA and DFA.
Conversion from NFA to DFA
This article will discuss a lot about the conversion of NFA to DFA, that is Nondeterministic Finite Automata(NFA) to Deterministic Finite Automata(DFA).
Conversion of Epsilon - NFA to NFA
This article will discuss the method of conversion of epsilon - NFA to NFA
In this article, we will study how to convert a DFA into an equivalent DFA having the minimum number of states.