Skip to content
Tue, Oct 13, 2026 / Ideas for a clearer worldINDEPENDENT INSIGHTS · PRACTICAL TOOLS · EXPLAINERS
Sign in
BROWSE THE ARCHIVE

Author: Taylor Emma

A senior editor for The Mars that left the company to join the team of SenseCentral as a news editor and content creator. An artist by nature who enjoys video games, guitars, action figures, cooking, painting, drawing and good music.

Theory of Computation

Pushdown Automata Acceptance by Final State

We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now, in this article, we will discuss…

August 14, 2021 · Taylor Emma
Theory of Computation

Construct Pushdown Automata for given languages

Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final StateA push down automata is similar to deterministic finite automata except…

August 14, 2021 · Taylor Emma
Theory of Computation

Introduction of Pushdown Automata

We have already discussed finite automata. But finite automata can be used to accept only regular languages.Pushdown Automata is…

August 14, 2021 · Taylor Emma
Theory of Computation

Ambiguity in Context-Free Grammars

If a context free grammar G has more than one derivation tree for some string w ∈ L(G), it is called an ambiguous grammar.…

August 14, 2021 · Taylor Emma
Theory of Computation

Classification of Context Free Grammars

Context Free Grammars (CFG) can be classified on the basis of following two properties: 1) Based on number of strings…

August 14, 2021 · Taylor Emma
Theory of Computation

Language Generated by a Grammar

The set of all strings that can be derived from a grammar is said to be the language…

August 14, 2021 · Taylor Emma
Theory of Computation

Introduction to Grammars

n the literary sense of the term, grammars denote syntactical rules for conversation in natural languages. Linguistics have…

August 14, 2021 · Taylor Emma