Example of PDA in Hindi | Example of Pushdown Automata in Hindi
Unit 4
Push down Automata
Topic 2 : Example of PDA in Hindi | Example of Pushdown Automata in Hindi
निम्नलिखित PDA कि formal description है जो Language को मान्यता देता है
M = (Q , ∑ , Γ , δ , q0 , Z , F)
States : Q = {p,q,r}
input alphabet : ∑ = {0,1}
stack alphabet : Γ = {A , Z}
start state = q0 = p
start stack symbol : Z
accepting states : F = { r }
Transition Relation δ निम्न्लिखित 6 Instructions Consists करता है
शब्दों में, first two instructions कहते हैं कि State p में किसी भी समय Symbol 0 read किया जाता है, एक A को Stack पर pushed कर दिया जाता है। एक A के top पर Symbol A को Push कर देना AA द्वारा Top A की जगह के रूप में Formal form मे दिया जाता है (और इसी तरह Symbol A को Z के Top पर Push करने के लिए)।
Related Post
- What is Automata machine in hindi | Examples of automata machines
- Finite Automata as a language acceptor and translator | Deterministic Finite Automata (DFA) | Nondeterministic Finite Automata(NFA) in Hindi
- What is Moore machines and mealy machines in Hindi
- What is Turing machine (composite machine) in toc in hindi
- Conversion from Mealy to Moore and vice versa in Hindi
- Non Deterministic Finite Automata in Hindi (NDFA)
- Deterministic Finite Automaton in Hindi (DFA) | Deterministic Finite-State Machine (DFSM)
- Conversion of NDFA to DFA in Hindi
- Arden's Theorem in TOC in Hindi
- Minimization of DFA in Hindi (Minimization of Automata Machines)
- Regular Expression in TOC in Hindi
- Union process in DFA | What is Union process in TOC
- Intersection of Finite Automata in Hindi
- Properties of Context Free Languages Hindi
- Two-way Deterministic Finite Automaton (2DFA) in Hindi
- Types of Grammar in TOC in Hindi | Chomsky Hierarchy in Theory of Computation
- Derivation Tree in TOC in Hindi
- Ambiguity in Grammar in TOC in Hindi
- Simplification of context free grammar in Hindi
- Conversion of grammar to automata machine and vice versa in Hindi
- Chomsky normal form and Greibach normal form in hindi
- What is Pushdown Automata in TOC in Hindi
- Example of PDA in Hindi | Example of Pushdown Automata in Hindi
- Deterministic pushdown automaton And Non-Deterministic pushdown automaton in Hindi
- Conversion of PDA Into Context Free Grammar and Vice Versa | PDA in TOC in hindi | Push Down Automata in Hindi | Context Free Grammar in Hindi
- CFG equivalent to PDA in hindi | context free grammar equivalent to push down automata in hindi | toc tutorial in hindi | theory of computation in hindi