Tutorials
Courses

Similar Topics

Web Technologies32.7K+ articles

Python19.6K+ articles

Misc7.8K+ articles

AI-ML-DS3.9K+ articles

Computer Networks3.5K+ articles

GBlog2.8K+ articles

Machine Learning2.5K+ articles

Software Engineering2.3K+ articles

GATE CS1.1K+ articles

Operating Systems991+ articles

Computer Subject / Computer Science Quizzes / Theory of Computation

Theory of Computation

274+ posts

Symbolic Model Checking

Last Updated: 06 October 2023

A formal verification technique called symbolic model checking is employed to confirm the accuracy and security of software and hardware systems. It is widely used in many...read more

Theory of Computation

Last Updated: 22 July 2023

In the world of computer science, there's something called a Finite State Machine (FSM). It's basically a mathematical model that helps us understand how things behave whe...read more

Theory of Computation

Automatic Lexical Generator

Last Updated: 11 July 2023

In this article, we are going to understand automatic lexical generators but before that, we have to understand what is Lexical analysis so let's understand Lexical Analys...read more

article_image

Theory of Computation

What is Context-Free Grammar?

Last Updated: 23 May 2025

A grammar consists of one or more variables that represent classes of strings (i.e., languages) . There are rules that say how the strings in each class are constructed. T...read more

article_image

Theory of Computation

Last Updated: 01 May 2024

A countable set is one that has the same cardinality (size) as the set of natural numbers, which is denoted by N (or often expressed as 0, 1, 2, 3,... in set theory). In o...read more

article_image

Theory of Computation

Geeks Premier League

Geeks Premier League 2023

Dovetailing in Turing Machines

Last Updated: 08 October 2023

In the carpentry industry, dovetailing is a technique of joining two pieces of wood together by interleaving them. Similarly in the case of Turing Machines dovetailing is ...read more

article_image

Theory of Computation

Geeks Premier League

Geeks Premier League 2023

Design a Turing Machine to Generate 'ww' from 'w'

Last Updated: 24 October 2023

Generate Turing Machine for L = {w w |- w | w∈ {a, b}}. In general, we have to double the data. For example, if the given word is abaa, then we have to generate abaaabaa.L...read more

article_image

Theory of Computation

Automata Tutorial

Last Updated: 30 January 2025

Automata Theory is a branch of the Theory of Computation. It deals with the study of abstract machines and their capacities for computation. An abstract machine is called ...read more

Theory of Computation

Theory of Computation (TOC) for GATE

Last Updated: 21 April 2025

Theory of Computation (TOC) is a key subject in the GATE CSE exam. Here's a complete tutorial on the Theory of Computationfor the GATE CSE exam. Whether you're revising or...read more

Theory of Computation

Equivalence in Theory of Computation

Last Updated: 28 January 2025

In the theory of computation, equivalence refers to the idea that two computational models, representations, or systems can recognize or process the same language or solve...read more

Theory of Computation

Why Do We Study Theory of Computation?

Last Updated: 30 January 2025

Theory of Computation (ToC) is the study of how computers solve problems using mathematical models. It helps us understand what computers can and cannot do, how efficientl...read more

Theory of Computation

Problems on Pushdown Automata

Last Updated: 30 January 2025

Pushdown Automata (PDA) are a special type of machine used in computer science to process certain types of languages, especially those that involve nested structures, like...read more

Theory of Computation

Problems on Finite Automata

Last Updated: 30 January 2025

Finite Automata (FA) are simple machines that help us understand how computers recognize patterns in data. They follow a set of fixed rules and read input step by step to ...read more

Theory of Computation

Problems on Turing Machine

Last Updated: 30 January 2025

Turing Machines (TM) are powerful machines that help us understand how computers solve complex problems. Unlike simpler machines, a Turing Machine has unlimited memory (a ...read more

Theory of Computation

Operations on DFA

Last Updated: 24 May 2025

Deterministic Finite Automata (DFA) are simple machines that help computers recognize patterns in data. They follow a set of fixed rules and read input step by step to det...read more

Theory of Computation

...