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 MEDIUM

In this article, we will explore the world of Automata, how automata perform tasks in a wide range of devices and machines available worldwide.

Author Nitika

1 upvote

Introduction of Automata Theory

Automata theory studies abstract machines (automata) and their computational capabilities, forming the foundation for formal languages, algorithms, and computational complexity.

Author Riya

3 upvotes

Finite State Machine

This article will discuss the Finite State Machine along with Deterministic and Non Deterministic finite automata in detail.

Author apoorv007

2 upvotes

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

Author Shivani Singh

0 upvotes

Non-Deterministic Finite Automata EASY

Non-Deterministic Finite Automata (NFA): This article covers the graphical representation of NFA, need, acceptance, and DFA vs NDFA.

Author Shivani Singh

1 upvote

Conversion from NFA to DFA MEDIUM

This article will discuss a lot about the conversion of NFA to DFA, that is Nondeterministic Finite Automata(NFA) to Deterministic Finite Automata(DFA).

Author apoorv007

1 upvote

Conversion of Epsilon - NFA to NFA MEDIUM

This article will discuss the method of conversion of epsilon - NFA to NFA

Author Riya

2 upvotes

DFA Minimization MEDIUM

In this article, we will study how to convert a DFA into an equivalent DFA having the minimum number of states.

Author Sanjana kumari

2 upvotes