We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Algebraic properties of complete residuated lattice valued tree automata.
- Authors
Ghorani, M.; Zahedi, M.; Ameri, R.
- Abstract
This paper investigates tree automata based on complete residuated lattice valued (referred to as L-valued) logic. First, we define the notions of L-valued set of pure subsystems and L-valued set of strong pure subsystems, as well as, their relation is considered. Also, L-valued n-tuple operator consist of n successors is defined, some of its properties are examined and its relation with pure subsystem is analyzed. Furthermore, we investigate some concepts such as L-valued set of (strong) homomorphisms, L-valued set of (strong) isomorphisms, and L-valued set of admissible relations. Moreover, we discuss bifuzzy topological characterization of L-valued tree automata. Finally, the relations of homomorphisms between the L-valued tree automata to continuous mappings and open mappings is examined.
- Subjects
ALGEBRAIC functions; RESIDUATED lattices; HOMOMORPHISMS; ISOMORPHISM (Mathematics); FUZZY automata
- Publication
Soft Computing - A Fusion of Foundations, Methodologies & Applications, 2012, Vol 16, Issue 10, p1723
- ISSN
1432-7643
- Publication type
Article
- DOI
10.1007/s00500-012-0856-y