Inference of parsable graph grammars for syntactic pattern recognition

MaRDI QIDQ5431928zbMATH OpenFDO

Authors Mariusz Flasiński

Publication date 2 January 2008

zbMATH Keywords

grammatical inferencegraph grammargraph parsingsyntactic pattern recognition

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 820122
• Parsing of edNLC-graph grammars for scene analysis
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Power properties of NLC graph grammars with a polynomial membership problem
• scientific article; zbMATH DE number 147108

Cited in

(14)

• Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
• Parsing of edNLC-graph grammars for scene analysis
• scientific article; zbMATH DE number 4024823 (Why is no real title available?)
• scientific article; zbMATH DE number 4043286 (Why is no real title available?)
• scientific article; zbMATH DE number 4049101 (Why is no real title available?)
• scientific article; zbMATH DE number 147108 (Why is no real title available?)
• Artificial Intelligence and Soft Computing - ICAISC 2004
• scientific article; zbMATH DE number 4114091 (Why is no real title available?)
• scientific article; zbMATH DE number 820118 (Why is no real title available?)
• scientific article; zbMATH DE number 820122 (Why is no real title available?)
• Designing and Learning Substitutable Plane Graph Grammars
• Syntactic pattern recognition
• scientific article; zbMATH DE number 4182859 (Why is no real title available?)
• Fundamental methodological issues of syntactic pattern recognition

This page was built for publication: Inference of parsable graph grammars for syntactic pattern recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431928)