Akila Krishnamoorthy

dfa nfa conversion equivalence problem cfg automata theory bottom-up parser parsing techniques class p and np time complexity code enumeration halting problem multi-track multi-tape thompson method nfa-e re ndpa dpda empty stack final state pda finite automata regular expression epsilon construction language tuples of fa transition function state diagram models conversion problem context fee grammar normal forms gnf cnf slr parser canonical lr lalr parser clr parser compiler design ist linked queue stack arrays datastructure c programming engineering c concepts c strings interview tips