## Construct Pushdown Automata for all length palindrome

A Pushdown Automaton (PDA) is like an epsilon Non deterministic Finite Automata (NFA) with infinite stack. PDA is a way to implement context free languages.… Read More »

Quick Links for TOC

Recent Articles |

MCQ / Quizzes |

Practice Problems |

Last Minute Notes (LMNs) |

A Pushdown Automaton (PDA) is like an epsilon Non deterministic Finite Automata (NFA) with infinite stack. PDA is a way to implement context free languages.… Read More »

Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final State A push down automata is similar to deterministic finite automata except that it has a… Read More »

The star height relates to the field of theoretical of computation (TOC). It is used to indicate the structural complexity of regular expressions and regular… Read More »

We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now, in this article, we will discuss how PDA can accept a… Read More »

Lex is a computer program that generates lexical analyzers. Lex is commonly used with the yacc parser generator. Lex, originally written by Mike Lesk and… Read More »

Prerequisite – Context Free Grammars, Simplifying Context Free Grammars A context free grammar (CGF) is in Geribach Normal Form (GNF) if all production rules satisfy… Read More »

A grammar is a set of production rules which are used to generate strings of a language. In this article, we have discussed how to… Read More »

Prerequisite – Simplifying Context Free Grammars A context free grammar (CGF) is in Chomsky Normal Form (CNF) if all production rules satisfy one of the… Read More »

Non-determinestic Finite Automata (NFA) : NFA is a finite automaton where for some cases when a single input is given to a single state, the… Read More »

Prerequisite – Introduction of FA, Regular expressions, grammar and language, Designing FA from Regular Expression There are two methods to convert FA to regular expression… Read More »

Prerequisite – Turing Machine A problem is said to be Decidable if we can always construct a corresponding algorithm that can answer the problem correctly.… Read More »

Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation… Read More »

Context-Sensitive Grammar – A Context-sensitive grammar is an Unrestricted grammar in which all the productions are of form – Where α and β are strings… Read More »

Prerequisite – Chomsky Hierarchy, Regular Languages As we all are aware that languages accepted by finite automata are called regular languages and those which are… Read More »

Decidable Problems A problem is decidable if we can construct a Turing machine which will halt in finite amount of time for every input… Read More »