3,995 views
3 votes
3 votes
The automaton which allows transformation to a new state without consuming any input symbol:

a) NFA

b) DFA

c) NFA-l

d) All of the mentioned.

1 Answer

2 votes
2 votes
ANS:C

In the automata theory, a nondeterministic finite automaton with ε-moves (NFA-ε)(also known as NFA-λ) is an extension of non-deterministic finite automaton(NFA), which allows a transformation to a new state without consuming any input symbols. The transitions without consuming an input symbol are called ε-transitions or λ-transitions. In the state diagrams, they are usually labeled with the Greek letter ε or λ.

Related questions

0 votes
0 votes
1 answer
1
admin asked Sep 30, 2023
117 views
The value of $5 \times 2-[3-\{5-(7+2 \times 4-19)\}]$ is :$0$$14$$16$$-5$
0 votes
0 votes
4 answers
2
mohitbawankar asked Dec 24, 2017
711 views
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold.A)AdditivelyB)MultiplicativelyC)ExponentiallyD) NONE
1 votes
1 votes
2 answers
3
mohitbawankar asked Dec 24, 2017
2,077 views
If a random coin is tossed 11 times then what is the probability that for 7th toss head appears exactly 4 times?5/3215/12835/128None of the options