1,410 research outputs found
A Bibliography on Fuzzy Automata, Grammars and Lanuages
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics and natural language processing
Fuzzy graphs: Algebraic structure and syntactic recognition
© Springer Science+Business Media Dordrecht 2013. Directed fuzzy hypergraphs are introduced as a generalization of both crisp directed hypergraphs and directed fuzzy graphs. It is proved that the set of all directed fuzzy hypergraphs can be structured into a magmoid with operations graph composition and disjoint union. In this framework a notion of syntactic recognition inside magmoids is defined. The corresponding class is proved to be closed under boolean operations and inverse mor-phisms of magmoids. Moreover, the language of all strongly connected fuzzy graphs and the language that consists of all fuzzy graphs that have at least one directed path from the begin node to the end node through edges with membership grade 1 are recognizable. Additionally, a useful characterization of recognizability through left derivatives is also achieved
Character recognition using a neural network model with fuzzy representation
The degree to which digital images are recognized correctly by computerized algorithms is highly dependent upon the representation and the classification processes. Fuzzy techniques play an important role in both processes. In this paper, the role of fuzzy representation and classification on the recognition of digital characters is investigated. An experimental Neural Network model with application to character recognition was developed. Through a set of experiments, the effect of fuzzy representation on the recognition accuracy of this model is presented
A probabilistic model of computing with words
AbstractComputing in the traditional sense involves inputs with strings of numbers and symbols rather than words, where words mean probability distributions over input alphabet, and are different from the words in classical formal languages and automata theory. In this paper our goal is to deal with probabilistic finite automata (PFAs), probabilistic Turing machines (PTMs), and probabilistic context-free grammars (PCFGs) by inputting strings of words (probability distributions). Specifically, (i) we verify that PFAs computing strings of words can be implemented by means of calculating strings of symbols (Theorem 1); (ii) we elaborate on PTMs with input strings of words, and particularly demonstrate by describing Example 2 that PTMs computing strings of words may not be directly performed through only computing strings of symbols, i.e., Theorem 1 may not hold for PTMs; (iii) we study PCFGs and thus PRGs with input strings of words, and prove that Theorem 1 does hold for PCFRs and PRGs (Theorem 2); a characterization of PRGs in terms of PFAs, and the equivalence between PCFGs and their Chomsky and Greibach normal forms, in the sense that the inputs are strings of words, are also presented. Finally, the main results obtained are summarized, and a number of related issues for further study are raised
- …