Answers>Computing>A Level>Article

How is different an NFA from a DFA?

The difference between an NFA (non-deterministic finite state automaton) and a DFA (deterministic finite state automaton) is that while in the former we can have more than one transition with the same label from the same state, in the latter each label has only one transition associated with it.

Answered by Michelangelo P. • Computing tutor

1852 Views

See similar Computing A Level tutors

How is different an NFA from a DFA?

Related Computing A Level answers

What is the difference between Serial and Parallel transmission of data?

What are the main differences between different loops when it comes to coding ?

Write pseudocode for the binary search algorithm and state, with an explanation, it's worst case complexity in big-O notation

Explain why it is important to check the email address with JavaScript and again when it reaches the server.

We're here to help

Company Information

Popular Requests

© MyTutorWeb Ltd 2013–2025

CLICK CEOP