0 votes 0 votes Statement-no. of transition defined states in a DFA =|€|. Where |€|= length of input alphabet. Why? Theory of Computation theory-of-computation finite-automata + – AIkiran01 asked Jun 1, 2018 • retagged Jun 20, 2022 by Lakshman Bhaiya AIkiran01 200 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.