3 votes 3 votes $L= \{a^nb : n \geq 0\} \cup \{b^na : n \geq 1\}$ Theory of Computation theory-of-computation minimal-state-automata + – Isha Karn asked Sep 19, 2014 • retagged Aug 22, 2015 by Arjun Isha Karn 455 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes 6 states are required. gatecse answered Sep 19, 2014 • selected Sep 19, 2014 by gatecse gatecse comment Share Follow See all 0 reply Please log in or register to add a comment.