A look into different Turing Machine transitions and how they affect the tape. Notations explained.

The formal definition of a Turing Machine and some observations are discussed.

This article explores a step by step approach to prove that a language is not regular by using the Closure Properties of Regular languages.

This article explores the limitations of Deterministic PushDown Automaton (DPDA) transitions to ensure determinism.

Proofs for closure of Context-Free Languages (CFL) under Union, Concatenation, Star, Reversal, Prefix and Subsequence.

The article discusses, with the help of an example, a step-by-step approach to convert a Pushdown Automaton (PDA) to a Context-Free Grammar (CFG).

The article discusses, with the help of an example, a step-by-step approach to convert a Context-Free Grammar (CFG) to a Pushdown Automaton (PDA).

A short examination of extended PushDown Automaton transitions and their equivalence with PushDown Automaton transitions.

This article discusses the different transition scenarios in a Pushdown Automaton with respect to reading the input and modifying the stack.

This article discusses the concept of ambiguity using parse-trees. Observations about parse-trees for grammars in Chomsky Normal Form are also mentioned.