deterministic finite automaton

URI: https://gptkb.org/entity/deterministic_finite_automaton
GPTKB entity
Statements (30)
Predicate Object
gptkbp:instanceOf gptkb:logic
gptkb:Technical_Machine
gptkbp:abbreviation gptkb:DFA
gptkbp:allows regular languages
gptkbp:complexity linear time membership test
gptkbp:contrastsWith gptkb:nondeterministic_finite_automaton
gptkbp:hasApplication model checking
lexical analysis
pattern matching
network protocol analysis
gptkbp:hasComponent transition function
finite set of states
start state
input alphabet
set of accept states
gptkbp:hasEquivalence gptkb:nondeterministic_finite_automaton
gptkbp:hasProperty deterministic transitions
no epsilon transitions
gptkbp:introduced gptkb:Walter_Pitts
gptkb:Warren_McCulloch
gptkbp:introducedIn 1943
gptkbp:limitation cannot recognize non-regular languages
gptkbp:supportsAlgorithm minimization algorithm
subset construction
gptkbp:usedIn computer science
formal language theory
gptkbp:bfsParent gptkb:Rabin–Scott_automata
gptkb:finite_automata
gptkbp:bfsLayer 6
https://www.w3.org/2000/01/rdf-schema#label deterministic finite automaton