Conversion of grammar to automata machine and vice versa in Hindi
Unit 3
Grammars
Topic 5 : Conversion of grammar to automata machine and vice versa in Hindi
Grammar को automata में Conversion करना सरल है। इसके लिये निम्नलिखित steps का पालन करें:
- First Production से शुरू करें
- और फिर हर left alphabet के लिए इसके बाद SYMBOL पर जाएं
- Start State: यह first production's state होगा
- Final State उन States को लें जो input alphabets के साथ end होते हैं। उदा। State A और C CFG से नीचे हैं
यहां हम एक right linear grammar दे रहे हैं
A -> aB/bA/b
B -> aC/bB
C -> aA/bC/a
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
- Petri Net Model in Hindi | Theory of Computation (TOC) Explained
- Techniques for Turing Machine Construction in Hindi
- Universal Turing Machine and Multitape in Hindi
- Multihead Turing Machine और Multidimensional Turing Machine की विशेषताएँ और अंतर
- NP Complete Problem in Hindi