Abstract: In syntactic pattern recognition an object is described by symbolic data. The problem of recognition is to determine whether the describing mathematical structure, for instance a graph, belongs to the language generated by a grammar describing the mentioned mathematical structures. So called ETPL(k) graph grammars are a known class of grammars used in pattern recognition. The approach in which ETPL(k) grammars are used was generalized by using probabilistic mechanisms in order to apply the method to recognize distorted patterns. In this paper the next step of the method generalization is proposed. The ETPL(k) grammars are improved by fuzzy sets theory. It turns out that the mentioned probabilistic approach can be regarded as a special case of the proposed one. Applications to robotics are considered as well.

@conference{icinco07,author={Marzena Bielecka and Marek Skomorowski and Andrzej Bielecki},title={FUZZY-SYNTACTIC APPROACH TO PATTERN RECOGNITION AND SCENE ANALYSIS},booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,},year={2007},pages={29-35},publisher={SciTePress},organization={INSTICC},doi={10.5220/0001625300290035},isbn={978-972-8865-83-2},}