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.
Finite State Machine
By Apoorv
● Published At Feb 2022
This article will discuss the Finite State Machine in detail.... Keep reading ..
Deterministic Finite Automata or DFA
By Shivani Singh
● Published At Jun 2022
In this blog, we will discuss Finite Automata, its formal definition, its types, Deterministic Finite Automata, its formal definition, needs, and examples... Keep reading ..
Non-Deterministic Finite Automata
By Shivani Singh
● Published At Jun 2022
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.... Keep reading ..
Conversion of NFA to DFA
By Apoorv
● Published At Mar 2022
This article will discuss a lot about the conversion of NFA to DFA, that is Nondeterministic Finite Automata(NFA) to Deterministic Finite Automata(DFA).... Keep reading ..
DFA Minimization
By Jaglike Makkar
● Published At Mar 2022
In this article, we will study how to convert a DFA into an equivalent DFA having the minimum number of states.... Keep reading ..
puzzle icon

Top Problems related to Basics of TOC