Search code examples
finite-automatastate-machineautomatadfaautomata-theory

Can a DFA have epsilon/lambda transitions?


Can´t find anything affirmative about it. And a NFA with any epsilon transition is a epsilon-NFA ? Thanks.


Solution

  • DFA doesn't have epsilon transitions.If it had it, it could transit from current state to other state without any input i.e. with nothing , not even {} or phi. And as definition , we know that the input must be from the input set. Hope this cleared your doubt ...