Decidability of the minimization of fuzzy tree automata with membership values in complete lattices

Ghorani, Maryam; Moghari, Somaye

doi:10.1007/s12190-021-01529-6

Cited by 5 publications

(3 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The bisimulation relation models equivalence between states of nondeterministic automata [45]. The equivalence relation between states of an automaton is done to minimize the automaton, and the equivalence relation between states of two automata is usually done for comparing their behaviors [13,14,32].…”

Section: Related Workmentioning

confidence: 99%

“…A fuzzy automaton calculates a fuzzy grade of acceptance for each input term. As well, Fuzzy Tree Automata (FTA) [9,13,14,31] deal with the logic of computation by processing tree structures and calculating the grade of acceptance for each input tree based on its structural characteristics. A Fuzzy Tree Language (FTL) is a fuzzy set of trees in which an FTA recognize them [4,9,32,33,36].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesizing fuzzy tree automata

Moghari

2022

RAIRO-Theor. Inf. Appl.

Self Cite

View full text Add to dashboard Cite

Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined tree structures. The behavior of a fuzzy tree automaton generates a fuzzy tree language by mapping a set of regular trees on a ranked alphabet to fuzzy membership values. It calculates the membership grade of trees using a set of rules that process their structural characteristics. This paper deals with constructing fuzzy tree automata models that their behavior satisfies a set of given logical propositions (called properties) on the structure of trees. Our goal is uncertainty modeling by synthesizing fuzzy tree automata whose behavior is described by fuzzy linguistic variables. In this regard, we first provide several patterns and heuristic tricks and techniques for constructing fuzzy tree automata that satisfy simple properties. Then, we develop a method for modeling complex propositional formulas based on the conversion of a logical formula into a computation tree, as well as a step-by-step combination of models.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Synthesizing fuzzy tree automata

Moghari

2022

RAIRO-Theor. Inf. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, minimization of the mealy type of fuzzy finite automaton is discussed in [3], minimization of fuzzy finite automaton with crisp final states without outputs is studied in [2], and minimization of deterministic finite automaton with fuzzy (final) states in [16]. For more information see [1,7,8,10,30].…”

Section: Introductionmentioning

confidence: 99%

Vector General Fuzzy Automaton: A Refining Analyzing

Shamsizadeh,

Abolpour,

Movahednia

et al. 2023

Int. J. Anal. Appl.

View full text Add to dashboard Cite

This study aims to investigate the refining relation between two vector general fuzzy automata (VGFA) and prove that refining relation is an equivalence relation. Moreover, Also, we prove that if there exists a refining equivalence between two VGFA, then they have the same language. After that, by considering the notion of refining equivalence, we present the quotient of VGFA. In particular, we show that any quotient of a given VGFA and the VGFA itself have the same language. Furthermore, using the quotient VGFA, we obtain a minimal VGFA with the same language.

show abstract

Characterization of Tree Automata Based on Quantum Logic

Ghorani

2022

Int J Theor Phys

View full text Add to dashboard Cite

Decidability of the minimization of fuzzy tree automata with membership values in complete lattices

Cited by 5 publications

References 30 publications

Synthesizing fuzzy tree automata

Synthesizing fuzzy tree automata

Vector General Fuzzy Automaton: A Refining Analyzing

Characterization of Tree Automata Based on Quantum Logic

Contact Info

Product

Resources

About