K. Padma Reddy Typical edition: 2nd or 3rd (used widely in Indian universities, especially JNTU) Publisher: B.S. Publications / S. Chand (varies) Target audience: Undergraduate CS/IT students (mostly 3rd–4th semester)
There are several types of formal languages, including: If you don’t own it, borrow it from
Padma Reddy’s "Finite Automata and Formal Languages" remains a gold standard for engineering students because it bridges the gap between rigorous computer science theory and practical exam requirements. While the temptation to find a free PDF is understandable given the academic pressure, supporting the author and publisher ensures that such high-quality educational resources continue to be updated and published for future students. If you don’t own it
If you already own it, supplement with Michael Sipser’s Introduction to the Theory of Computation (for intuition) or Hopcroft/Ullman (for rigor). If you don’t own it, borrow it from a friend or library before buying. If you don’t own it, borrow it from
While I couldn't find a specific article by Padma Reddy on this topic, I hope this comprehensive overview has provided you with a good understanding of finite automata and formal languages.
Coverage of regular expressions, identity rules, and the Pumping Lemma for proving non-regularity.