Nondeterministic finite automaton
id:
nondeterministic-finite-automaton-168-5676243
title:
Nondeterministic finite automaton
text:
In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if
- each of its transitions is uniquely determined by its source state and input symbol, and
- reading an input symbol is required for each state transition. A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need to obey these restrictions. In particular, every DFA is also an NFA. Sometimes the term NFA is used in a narrower sense, referring to an NFA that
brand slug:
wiki
category slug:
encyclopedia
description:
Type of finite-state machine in automata theory
original url:
https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton
date created:
2004-05-14T06:21:25Z
date modified:
2024-08-30T20:14:54Z
main entity:
{"identifier":"Q617295","url":"https://www.wikidata.org/entity/Q617295"}
image:
fields total:
13
integrity:
15