Tree Systems for Syntactic Pattern Recognition
From MaRDI portal
Cited in
(12)- Tree pushdown automata
- New algorithms for the LCS problem
- A syntactic approach to time-varying pattern analysis
- A multidimensional approach to syntactic pattern recognition
- Parallel parsing of tree languages for syntactic pattern recognition
- A new practical linear space algorithm for the longest common subsequence problem
- Regular-like tree expressions
- Syntactic/semantic techniques in pattern recognition: A survey
- An algorithm for the inference of tree grammars
- Object Recognition by Recursive Learning of Multiscale Trees
- Distance measures for geometric graphs
- Computing a longest common subsequence for a set of strings
This page was built for publication: Tree Systems for Syntactic Pattern Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3212700)