|
gptkbp:instanceOf
|
Mathematical Model
|
|
gptkbp:alsoKnownAs
|
Technical Machine
|
|
gptkbp:appliesTo
|
Control Systems
Digital Circuit Design
Protocol Design
Text Processing
|
|
gptkbp:describes
|
Computation
System Behavior
|
|
gptkbp:formedBy
|
State Diagram
State Transition Table
|
|
gptkbp:hasApplication
|
gptkb:Traffic_Lights
Network Protocols
Pattern Matching
Vending Machines
Lexical Analysis
|
|
gptkbp:hasComponent
|
States
Transitions
Inputs
Outputs
|
|
gptkbp:hasType
|
gptkb:Nondeterministic_Finite_Automaton
gptkb:Deterministic_Finite_Automaton
gptkb:Mealy_Machine
gptkb:Moore_Machine
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Finite State Model
|
|
gptkbp:inventedBy
|
1950s
|
|
gptkbp:limitation
|
Cannot recognize context-free languages
Limited memory
|
|
gptkbp:mathematicallyDefinedBy
|
5-tuple (Q, Σ, δ, q0, F)
|
|
gptkbp:relatedTo
|
gptkb:Turing_Machine
Pushdown Automaton
Regular Language
|
|
gptkbp:studiedIn
|
Automata Theory
|
|
gptkbp:usedIn
|
gptkb:Linguistics
Computer Science
Engineering
|
|
gptkbp:bfsParent
|
gptkb:FIPS_140-2_Compliance
|
|
gptkbp:bfsLayer
|
8
|