Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The Context sensitive grammar (CSG) is defined as G=(V, Σ, P, S)Where, V: Non terminals or variables.Σ: Input symbols.P: Production rule.P:{αAβ → αγβ, A ϵ V, α ϵ (V∪Σ)*, β ϵ (V∪Σ)*S: Starting symbol.ExampleaS→SAa|aAaA→abcIn context sensitive grammar, there is either left context or right context (αAβ i.e. α is left context and β is right) with variables.But in context free grammar (CFG) there will be no context.For example in production ruleS →0 B S 2 ,B 0 → 0 BWe cannot replace B until we get B0.Therefore, CSG is harder to understand than the CFG.The CFG, CSG and the unrestricted ... Read More
If the grammar satisfies the following two conditions, then we can say that type of grammar is called as operator precedence grammar.If ε is on its RHS then there exists no production rule.If two non-terminals are adjacent to each other on its RHS then there exists no production rule.Operator Grammars have the property that no production right side is empty or has two adjacent non-terminals.ExampleE-> E A E | idA-> + | *The above grammar is not an operator grammar but we can convert that grammar into operator grammar like −E-> E + E | E * E | idThere ... Read More
A Context Free Grammar (CFG) is said to be in Greibach Normal Form(GNF), if production rules satisfy one of the following criteria −Only a start symbol can generate ε. For example, if S is the start symbol then S → ε is in GNF.A non-terminal can generate a terminal. For example, if A is Non terminal and a is terminal then, A → a is in GNF.A non-terminal can generate a terminal followed by any number of non-terminals. For Example, S → aAS is in GNF.Case 1G1 = {S → aAB | aB, A → aA| a, B → bB ... Read More
We know that the languages accepted by finite automata (FA) are called regular languages and the languages accepted by push down automata (PDA) are called context free languages (CFG).Closure of CFLs under UnionCFL is the short form for Context Free Language. Here the CFL is as follows −G = (V, Σ, R, S) such that L(G) = L(G1) ∪ L(G2)Thus, V = V1 ∪ V2 ∪ {S} (the three sets are disjoint)Σ = Σ1 ∪ Σ2R = R1 ∪ R2 ∪ {S → S1|S2}Union of Regular language with CFGIf all regular languages are context-free then union of both results is ... Read More
Mealy MachineIn a Mealy machine the output symbol depends upon the present input symbol and present state of the machine.In the Mealy machine, the output is represented with each input symbol and each state is separated by /.The Mealy machine can be described by six tuples (Q, q0, Σ, O, δ, λ')Where, Q: Finite set of states.q0: Initial state of machine.Σ: Finite set of input alphabet.O: Output alphabet.δ: Transition function where Q × Σ → Q.λ': Output function where Q × Σ → O.In the Mealy machine, the output is represented with each input symbol and each state is separated ... Read More
The cross product method process in the deterministic finite automata (DFA) is explained below −Let a's DFA diagram has m number of states and b's DFA diagram has n number of states the cross product m x n will have mxn states.Languages represented by even number of ‘a’ and even number of ‘b’ are given below −L1 = {ε, baa, aa, aba, aab, aaaa, ... }L2 = {ε bb, abb, bab, bba, ...}After cross product we will find the DFA as mentioned below −As, L = {ab, aab, abb, aaab, ...}ExampleLet’s taken two DFAsEven number of a'sEven number of b'sThe ... Read More
The union process in the deterministic finite automata (DFA) is explained below −If L1 and If L2 are two regular languages, their union L1 U L2 will also be regular.For example, L1 = {an | n > O} and L2 = {bn | n > O}L3 = L1 U L2 = {an U bn | n > O} is also regular.ProblemDesign a DFA over an alphabet {a, b} where the start and end are of different symbols.SolutionThere are two different types of languages are formed for a given condition −L1={ab, aab, abab, abb, …….}L1={ab, aab, abab, abb, …….}Here, L1= starts ... Read More
A Deterministic Finite automaton (DFA) is a 5-tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemDesign a finite automaton where the second symbol from the right hand side is ‘a’.SolutionThe language for a given string over an alphabet {a, b} is −L={aa, abaa, abbab, aaabab, ………}ExampleInput − aabaOutput − Not acceptedBecause the second letter from right hand side is not aInput − aabbabOutput − AcceptedIt is complicated to directly construct ... Read More
A Deterministic Finite automaton (DFA) is a 5-tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemConstruct a DFA machine accepting odd numbers of 1’s and even number of 0’s.SolutionDesign two separate machines for the two conditions over an alphabet Σ={0, 1}:DFA accepts only an odd number of 1’s.DFA accepts only even number of 0’s.Here, s1 = starts2=odd 1 or start 11s3= starts 11 accepted and stay theres4 = accept even ... Read More
Non-deterministic finite automata (NFA) also have five states which are same as DFA, but with different transition function, as shown follows −δ: Q X Σ → 2QWhere, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemConstruct NFA over an alphabet Σ={0, 1}.SolutionDesign two separate machines for the two conditions, as given below −NFA accepting only odd number of 1’sNFA accepting only even number of 0’sNFA accepting only odd number of 1’s over an alphabet Σ= ... Read More