The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings

Published on Oct 14, 20102602 Views

We describe herein the results of implementing an algorithm for syntactic pattern recognition using the concept of Finite Inductive Sequences (FI). We discuss this idea, and then provide a big O esti

Related categories