Deterministic finite automaton

URI: https://gptkb.org/entity/Deterministic_finite_automaton
GPTKB entity
Statements (50)
Predicate Object
gptkbp:instanceOf Technical Machine
Mathematical model
gptkbp:abbreviation gptkb:DFA
gptkbp:allows Regular languages
gptkbp:canBeMinimized True
gptkbp:closed gptkb:Kleene_star
gptkb:intersection
Union
Complementation
Concatenation
gptkbp:complexity Linear time recognition
gptkbp:contrastsWith gptkb:Nondeterministic_finite_automaton
gptkbp:convertedTo gptkb:Nondeterministic_finite_automaton
gptkbp:describedBy 5-tuple (Q, Σ, δ, q0, F)
gptkbp:hasAcceptStates F
gptkbp:hasApplication Model checking
Pattern matching
Text processing
Lexical analysis
Hardware design
Network protocol design
gptkbp:hasComponent Finite set of states
Input alphabet
Set of accept states
Start state
Transition function
gptkbp:hasInputAlphabet Σ
gptkbp:hasProperty Deterministic transitions
No epsilon transitions
One transition per symbol per state
gptkbp:hasStartState q0
gptkbp:hasStateSet gptkb:Q
gptkbp:hasSubgroup gptkb:Finite_automata
gptkbp:hasTransitionFunction δ
https://www.w3.org/2000/01/rdf-schema#label Deterministic finite automaton
gptkbp:introduced gptkb:Walter_Pitts
gptkb:Warren_McCulloch
gptkbp:introducedIn 1943
gptkbp:limitation Cannot recognize non-regular languages
State explosion for some languages
gptkbp:relatedTo gptkb:Pushdown_automaton
Technical Machine
Regular expressions
gptkbp:represents State diagram
Transition table
gptkbp:usedIn gptkb:Automata_theory
gptkb:Formal_language_theory
Computer science
gptkbp:bfsParent gptkb:Nondeterministic_finite_automaton
gptkbp:bfsLayer 7