Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata
- 21 December 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 133-142
- https://doi.org/10.1007/3-540-44522-6_14
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Grammatical inference based on hyperedge replacementPublished by Springer Nature ,2005
- Handwritten digit recognition through inferring graph grammars. A first appproachPublished by Springer Nature ,1998
- The noisy subsequence tree recognition problemPublished by Springer Nature ,1998
- Handbook of Graph Grammars and Computing by Graph TransformationPublished by World Scientific Pub Co Pte Ltd ,1997
- Efficient learning of context-free grammars from positive structural examplesInformation and Computation, 1992
- A Width-Independent Fast Thinning AlgorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1985
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- Operations on Images Using Quad TreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Error-Correcting Tree Automata for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1978
- Error-Correcting Parsers for Formal LanguagesIEEE Transactions on Computers, 1978