Skip to content
Courses
DSA to Development
Get IBM Certification
Newly Launched!
Master Django Framework
Become AWS Certified
For Working Professionals
Interview 101: DSA & System Design
Data Science Training Program
JAVA Backend Development (Live)
DevOps Engineering (LIVE)
Data Structures & Algorithms in Python
For Students
Placement Preparation Course
Data Science (Live)
Data Structure & Algorithm-Self Paced (C++/JAVA)
Master Competitive Programming (Live)
Full Stack Development with React & Node JS (Live)
Full Stack Development
Data Science Program
All Courses
Tutorials
Data Structures & Algorithms
ML & Data Science
Interview Corner
Programming Languages
Web Development
CS Subjects
DevOps And Linux
School Learning
Practice
Build your AI Agent
GfG 160
Problem of the Day
Practice Coding Problems
GfG SDE Sheet
Contests
Accenture Hackathon (Ending Soon!)
GfG Weekly [Rated Contest]
Job-A-Thon Hiring Challenge
All Contests and Events
DSA
Practice Problems
Python
C
C++
Java
Courses
Machine Learning
DevOps
Web Development
System Design
Aptitude
Projects
Sign In
▲
Similar Topics
DSA
22.4k+ articles
Difference Between
3.6k+ articles
GATE
3.3k+ articles
Strings
3.2k+ articles
Algorithms
2k+ articles
GATE CS
1.4k+ articles
Computer Subject
1.3k+ articles
Pattern Searching
610+ articles
Compiler Design
270+ articles
DFA
21 articles
Computer Subject
>
Computer Science Quizzes
>
Theory of Computation
Theory of Computation
280+ posts
Popular Articles
Recent Articles
Difference between DFA and NFA
Last Updated: 04 October 2024
In automata theory four types of finite automata are used to recognize the regular language among these two are DFA and NFA. Both have the s
...read more
Theory of Computation
Difference Between
Closure properties of Regular languages
Last Updated: 10 May 2025
A closure property is a characteristic of a class of languages (such as regular, context-free, etc.) where applying a specific operation (li
...read more
Computer Subject
GATE CS
Theory of Computation
Introduction to UNIX System
Last Updated: 27 March 2025
UNIX is an innovative or groundbreaking operating system which was developed in the 1970s by Ken Thompson, Dennis Ritchie, and many others a
...read more
Computer Subject
GATE
Operating Systems Questions
Computer Organization and Architecture
Theory of Computation
Linux-Unix
Similar Topics
DSA
22.4k+ articles
Difference Between
3.6k+ articles
GATE
3.3k+ articles
Strings
3.2k+ articles
Algorithms
2k+ articles
GATE CS
1.4k+ articles
Computer Subject
1.3k+ articles
Pattern Searching
610+ articles
Compiler Design
270+ articles
DFA
21+ articles
Difference Between Mealy Machine and Moore Machine
Last Updated: 27 September 2024
In theory of computation and automata, there are two machines: Mealy Machine and Moore Machine which is used to show the model and behavior
...read more
GATE CS
Theory of Computation
Difference Between
Converting Context Free Grammar to Chomsky Normal Form
Last Updated: 16 April 2025
Chomsky Normal Form (CNF) is a way to simplify context-free grammars (CFGs) so that all production rules follow specific patterns. In CNF, e
...read more
GATE CS
Theory of Computation
Introduction to Theory of Computation
Last Updated: 28 January 2025
Automata theory, also known as the Theory of Computation, is a field within computer science and mathematics that focuses on studying abstr
...read more
GATE CS
Theory of Computation
Mealy and Moore Machines in TOC
Last Updated: 03 October 2024
Moore and Mealy Machines are Transducers that help in producing outputs based on the input of the current state or previous state. In this a
...read more
GATE CS
Theory of Computation
Turing Machine in TOC
Last Updated: 05 February 2025
Turing Machines (TM) play a crucial role in the Theory of Computation (TOC). They are abstract computational devices used to explore the lim
...read more
Theory of Computation
Minimization of DFA
Last Updated: 13 March 2024
DFA minimization stands for converting a given DFA to its equivalent DFA with minimum number of states. DFA minimization is also called as
...read more
Theory of Computation
Conversion from NFA to DFA
Last Updated: 20 January 2023
An NFA can have zero, one or more than one move from a given state on a given input symbol. An NFA can also have NULL moves (moves without i
...read more
Theory of Computation
Introduction of Pushdown Automata
Last Updated: 16 October 2024
We have already discussed finite automata. But finite automata can be used to accept only regular languages. Pushdown Automata is a finite
...read more
Theory of Computation
Regular Expressions, Regular Grammar and Regular Languages
Last Updated: 28 January 2025
To work with formal languages and string patterns, it is essential to understand regular expressions, regular grammar, and regular languages
...read more
GATE CS
Theory of Computation
Pumping Lemma in Theory of Computation
Last Updated: 21 October 2022
There are two Pumping Lemmas, which are defined for 1. Regular Languages, and 2. Context - Free Languages Pumping Lemma for Regular Language
...read more
Theory of Computation
Chomsky Hierarchy in Theory of Computation
Last Updated: 18 October 2024
According to Chomsky hierarchy, grammar is divided into 4 types as follows:Type 0 is known as unrestricted grammar.Type 1 is known as contex
...read more
Theory of Computation
Introduction of Finite Automata
Last Updated: 12 September 2024
Finite automata are abstract machines used to recognize patterns in input sequences, forming the basis for understanding regular languages i
...read more
Theory of Computation
1
2
3
4
5
6
7
8
>>
Last
1
2
3
4
5
6
>>
Last
1
2
3
4
>>
Last
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our
Cookie Policy
&
Privacy Policy
Got It !