Turing machine for multiplication

Turing machine for subtraction | Set 1

Turing Machine for subtraction | Set 2

Turing Machine in TOC

Union and Intersection of Regular languages with CFL

Generating Regular Expression from Finite Automata

Grammar in Theory of Computation

Introduction of Finite Automata

Introduction of Pushdown Automata

Operator Grammar and Precedence Parser

Problems on Finite Automata

Problems on Pushdown Automata

Problems on Turing Machine

Program for Deterministic Finite Automata

Pushdown Automata Acceptance by Final State

Regular Expressions, Regular Grammar and Regular Languages

Relationship between grammar and language in Theory of Computation

Simplifying Context Free Grammars

Star Height of Regular Expression and Regular Language

Theory of Computation Tutorial

Turing Machine as Comparator

Turing machine for 1's and 2’s complement

Turing Machine for addition

Turing machine for copying data

Basics

Theory Of Computation MOC

Ambiguity in Context free Grammar and Languages

Applications of various Automata

Check if the language is Context Free or Not

Closure Properties of Context Free Languages

Code Implementation of Deterministic Finite Automata (Set 1)

Construct a Turing Machine for language L = {ww | w ∈ {0,1}}

Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}

Construct Pushdown Automata for all length palindrome

Construct Pushdown Automata for given languages

Context-sensitive Grammar (CSG) and Language (CSL)

Converting Context Free Grammar to Chomsky Normal Form

Converting Context Free Grammar to Greibach Normal Form

Designing Finite Automata from Regular Expression (Set 1)

Detailed Study of PushDown Automata