Все публикации

093 - Gribach Normal Form (GNF) & Left Recursion [TOC by Mahesh Goyani] - CodeCrucks

092 - Conversion of CFG to CNF - Example Set 2 | TOC by Mahesh Goyani | CodeCrucks

091 - Conversion of CFG to CNF - Example Set 1 | TOC by Mahesh Goyani | CodeCrucks

090 - Chomsky Normal Form (CNF)

089 - Simplifying Grammar (Removing Unit Productions) | TOC by Mahesh Goyani | CodeCrucks

088 - Simplifying Grammar (Removing e-Productions) | TOC by Mahesh Goyani | CodeCrucks

087 - Simplifying Grammar (Removing Uselss Symbols) | TOC by Mahesh Goyani | CodeCrucks

086 - Ambiguous Grammar |TOC by Mahesh Goyani | CodeCrucks

085 - Construction of Context Free Grammar (a^n, a^nb^m, ...) | TOC by Mahesh Goyani | CodeCrucks

084 - Construction of Context Free Grammar (Palindrome) | TOC by Mahesh Goyani | CodeCrucks

081 - Introduction to Context Free Grammar | TOC by Mahesh Goyani | CodeCrucks

083 - Construction of Context Free Grammar (RL to CFG) | TOC By Mahesh Goyani | CodeCrucks

082 - Construction of Context Free Grammar (FA to CFG) | TOC by Mahesh Goyani | CodeCrucks

050 - NFA vs DFA | TOC by Mahesh Goyani | CodeCrucks

045 - Conversion of ε-NFA to NFA - Example 1 | TOC by Mahesh Goyani | CodeCrucks

046 - Conversion of ε-NFA to NFA - Example 2 | TOC by Mahesh Goyani | CodeCrucks

043 - Introduction to ε-NFA | TOC by Mahesh Goyani | CodeCrucks

047 - Conversion of ε-NFA to NFA - Example 3 | TOC by Mahesh Goyani | CodeCrucks

042 - Conversion of NFA to DFA - Example 5 | TOC by Mahesh Goyani | CodeCrucks

044 - ε-closure | TOC by Mahesh Goyani | CodeCrucks

048 - Conversion of ε-NFA to DFA - Example 1 | TOC by Mahesh Goyani | CodeCrucks

049 - Conversion of ε-NFA to DFA - Example 2 | TOC by Mahesh Goyani | CodeCrucks

020 - Example of DFA (Counting of Symbols) | TOC by Mahesh Goyani | CodeCrucks

022 - Example of DFA (Substring) | TOC by Mahesh Goyani | CodeCrucks