## Chomsky Normal Form (CNF)

Chomsky Normal Form (CNF) It cannot contain the null, that CFG in which non-terminals belongs to two non-terminal. Or non-terminal belongs to only one terminal and non-terminal does not null,…

Skip to content
##
Chomsky Normal Form (CNF)

##
CFG Properties and Applications

##
Ambiguity in CFG

##
CFG- Context Free Grammar

##
Pumping Lemma

##
FA to Regular Expression construction

##
Regular language

##
Regular expression

##
Moore machine and Mealy machine

##
Non-deterministic finite automata

Chomsky Normal Form (CNF) It cannot contain the null, that CFG in which non-terminals belongs to two non-terminal. Or non-terminal belongs to only one terminal and non-terminal does not null,…

0 Comments

May 12, 2023

CFG Properties and Applications CFG- Context-free grammar is closure under: Union Concatenation Kleene Star Operation Union: Let suppose L1 and L2 are languages, they must have the finite set of…

May 11, 2023

Ambiguity in CFG Something when having more meaning and confusion occurs when select appropriate mean for the selected condition called Ambiguity. If a Context-Free Grammar can be drawn with more…

May 10, 2023

CFG- Context-Free Grammar CFG- Context-free grammar is semantic free grammar. CFG has the following terms. Terminals Non Terminals Production ǀ Rule Terminals: By using the terminals we can terminate our…

May 9, 2023

Pumping Lemma (PL) Without any proof the string or language is accepted as true, this process is known as Pumping lemma. Pumping Theorem Let ‘L’ be a regular language. There…

May 8, 2023

FA to Regular Expressions construction This topic designed for finite automata FA to regular expression (RE) construction. Case 1: Finite Automata for RE = 0 For a regular expression (RE)…

May 7, 2023

Definition of Regular Language A Regular language whose regular expressions can be drawn is known as regular language. Property of Regular Language: Closure Property: If L and M are two…

May 6, 2023

Regular expression A regular expression can be defined as the following properties. Kleene Star Closure: Kleene star closure can be shown as ∑ = Set of Alphabet ∑* = Set…

May 5, 2023

Moore machine A Moore machine that consists of the following The finite number of states such as q0, q1, q2…qn where q0 is the initial state. Finite input alphabet such…

May 4, 2023

Non-deterministic finite automata Non-deterministic finite automata have the same DFA characteristic but a slight change. The total number of the alphabet should be finite. A total number of strings should be…

May 3, 2023