Can a DFA have epsilon/lambda transitions?

finite-automata state-machine automata dfa automata-theory
liwing picture liwing · Dec 9, 2012 · Viewed 23.5k times · Source

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

Answer

Bhushan Firake picture Bhushan Firake · Dec 9, 2012

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 ...

Related questions

How to convert NFA/DFA to java?

I have a scenario where I have designed the NFA and using JFLAP I have converted it to DFA. I need to know, how to code it in Java? Basically how to implement those state transitions in Java. I have …

Read More
Advantages/Disadvantages of NFA over DFA and vice versa

What are the relative pro's and con's of both DFA's and NFA's when compared to each other? I know that DFA's are easier to implement than NFA's and that NFA's are slower to arrive at the accept state than DFA's …

Read More
How useful is Turing completeness? are neural nets turing complete?

While reading some papers about the Turing completeness of recurrent neural nets (for example: Turing computability with neural nets, Hava T. Siegelmann and Eduardo D. Sontag, 1991), I got the feeling that the proof which was given there was not really …

Read More