|
gptkbp:instanceOf
|
gptkb:logic
|
|
gptkbp:allows
|
regular languages
|
|
gptkbp:cannot_recognize
|
context-free languages
|
|
gptkbp:closure_property
|
gptkb:Kleene_star
gptkb:intersection
Union
complement
concatenation
|
|
gptkbp:field
|
automata theory
theoretical computer science
|
|
gptkbp:has_accept_states
|
subset of states
|
|
gptkbp:has_input_alphabet
|
finite set
|
|
gptkbp:has_start_state
|
unique state
|
|
gptkbp:has_state
|
finite number
|
|
gptkbp:has_transition_function
|
state transition
|
|
gptkbp:hasType
|
gptkb:deterministic_finite_automaton
gptkb:nondeterministic_finite_automaton
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
finite automata
|
|
gptkbp:introduced
|
1943
|
|
gptkbp:inventedBy
|
gptkb:Walter_Pitts
gptkb:Warren_McCulloch
|
|
gptkbp:minimization
|
possible
|
|
gptkbp:relatedTo
|
Turing machines
regular expressions
|
|
gptkbp:used_in
|
digital circuit design
compiler design
text processing
network protocol analysis
|
|
gptkbp:usedFor
|
lexical analysis
modeling computation
pattern matching
|
|
gptkbp:bfsParent
|
gptkb:Turing_completeness
gptkb:Automata_theory
|
|
gptkbp:bfsLayer
|
5
|