|
gptkbp:instanceOf
|
Technical Machine
Mathematical model
|
|
gptkbp:allows
|
Regular languages
|
|
gptkbp:definedIn
|
gptkb:Amazon
States
Start state
Transition function
Accept states
|
|
gptkbp:form
|
5-tuple
|
|
gptkbp:formedBy
|
gptkb:Dana_Scott
gptkb:Stephen_Kleene
gptkb:Michael_O._Rabin
|
|
gptkbp:hasProperty
|
Deterministic or nondeterministic
Finite number of states
Memoryless
|
|
gptkbp:hasType
|
gptkb:Nondeterministic_finite_automaton
gptkb:Deterministic_finite_automaton
Probabilistic finite automaton
ε-NFA
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Finite automata
|
|
gptkbp:introducedIn
|
1950s
|
|
gptkbp:limitation
|
Cannot recognize context-free languages
|
|
gptkbp:relatedTo
|
gptkb:Pushdown_automaton
Technical Machine
Regular expressions
|
|
gptkbp:studiedBy
|
gptkb:Noam_Chomsky
gptkb:Stephen_Kleene
|
|
gptkbp:usedFor
|
Model checking
Pattern matching
Text processing
Lexical analysis
|
|
gptkbp:usedIn
|
gptkb:Linguistics
gptkb:artificial_intelligence
gptkb:robot
gptkb:Game_theory
gptkb:Automata_theory
gptkb:Theoretical_computer_science
gptkb:Formal_language_theory
Natural language processing
Computer science
Control systems
Speech recognition
Discrete mathematics
Parsing
Software engineering
Compiler design
Digital circuit design
Algorithm design
Network protocol design
|
|
gptkbp:bfsParent
|
gptkb:Nondeterministic_finite_automaton
|
|
gptkbp:bfsLayer
|
7
|