non deterministic finite automata

Regular Expression The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. It is the most…

Ambiguity in Grammar A grammar is said to be ambiguous if there exists more than one leftmost derivation or more than one…

Chomsky Hierarchy Chomsky Hierarchy represents the class of languages that are accepted by the different machine. The category of language in Chomsky’s…

Conversion from NFA with ε to DFA Non-deterministic finite automata(NFA) is a finite automata where for some cases when a specific input…

Examples of DFA Example 1: Design a FA with ∑ = {0, 1} accepts those string which starts with 1 and ends…

Pushdown Automata(PDA) Pushdown automata is a way to implement a CFG in the same way we design DFA for a regular grammar.…

Conversion of RE to FA To convert the RE to FA, we are going to use a method called the subset method.…

Arden’s Theorem The Arden’s Theorem is useful for checking the equivalence of two regular expressions as well as in the conversion of…

Derivation Tree Derivation tree is a graphical representation for the derivation of the given production rules for a given CFG. It is…

Examples of Regular Expression Example 1: Write the regular expression for the language accepting all the string which are starting with 1…