What is Moore machines and mealy machines in Hindi
Unit 1
Introduction of Automata Theory
Topic 3 : What is Moore machines and mealy machines in Hindi
Mealy machines :
Mealy machines output value के साथ finite state machines भी हैं और इसका output current state और current input symbol पर depends करता है | इसे इस रूप में define किया जा सकता है (Q, q0, ∑, O, δ, λ’)
Mealy machines को 6 tuple का उपयोग कर के describe किया जाता है
Q : इसे finite set of states कहते है
∑ : यह finite set का symbol है इसे input alphabet कहा जाता है
O : यह finite set का symbol है इसे output alphabet कहा जाता है
δ : यह input transition function है ( δ: Q × ∑ → Q)
X : यह output transition function है (X: Q × ∑ → O)
Q0 :यह initial state है | जहा input processed किया जाता है
Moore Machine :
Moore machines output value के साथ finite state machines है | इसका output केवल current state पर depend करता है
Moore Machines को 6 tuple का उपयोग कर के describe किया जाता है
(Q, q0, ∑, O, δ, λ)
Q : इसे finite set of states कहते है
∑ : यह finite set का symbol है इसे input alphabet कहा जाता है
O : यह finite set का symbol है इसे output alphabet कहा जाता है
δ : यह input transition function है ( Q×∑ → Q.)
λ : यह output transition function है (X: Q × ∑ → O)
Q0 : यह initial state है | जहा input processed किया जाता है
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