… construction of syntax tree from regular expression were described … (DFA) based on regular
expression is presented using Z notation. … using fuzzy automata in [14]. A formal procedure of …

… tree is described directly from the regular expression to verify the lexical analyzer. At first,
augmented regular expression is described then an abstract syntax tree … using fuzzy automata …

… expressions. Recently, YM Li and W. Pedrycz have done … about fuzzy finite automata and
fuzzy regular expressions with … fuzzy finite automaton from a given fuzzy regular expression. A. …

… Otherwise, a fuzzy set is selected and a leaf is inserted in the tree. … a division of the expression
space of each feature into three different fuzzy sets. Other numbers of fuzzy sets were tried …

… tree differs from unordered fuzzy decision tree in the way of testing attributes. In ordered trees
… logic to handle ambiguous terms used in query expressions. To make the query processor …

… Now, we will partition the parse tree into a sub-tree using modular decomposition. The modular
decomposition technique was proposed by Yamamoto [34, 35] for the conversion of semi-…

… If we allow arbitrary bracketing, negation, and disjunction in logical expressions, the 'trees'
become unclear. We would argue that it is preferable to apply logic at a different level from …

… expression trees is chosen as the solution, from which a LATEX string can be generated. As
our fuzzy parsing algorithm works best on sub-expressions … , and the fuzzy parsing algorithm …

… expressions, mathematical functions, various symbolic expressions including crisp and fuzzy
decision trees, … We interpret data classes as fuzzy sets and evolve fuzzy search expressions …

… studied in this theory appears in mathematics, computer science and other areas as formal
terms, algebraic expressions, parse and derivation trees, computation trees, and generally as …