nach oben

Soft Computing

Erschienen in:

01.10.2012 | Original Paper

Algebraic properties of complete residuated lattice valued tree automata

verfasst von: M. Ghorani, M. M. Zahedi, R. Ameri

Erschienen in: Soft Computing | Ausgabe 10/2012

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel A novel two-stage hybrid swarm intelligence optimization algorithm and application

Nächster Artikel Dynamic effect algebras and their representations

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Abolpour KH, Zahedi MM (2012) Isomorphism between two BL-general fuzzy automata. Soft Comput 16:729–736CrossRef

Bozapalidis S, Bozapalidoy OL (2010) Fuzzy tree language recognizability. Fuzzy Sets Syst 161:716–734MathSciNetMATHCrossRef

Comon H, Dauchet M, Gilleron R, Jacquemard F, Lugiez D, Loding C, Tison S, Tommasi M (2007) Tree automata: techniques and applications. http://tata.gforge.inria.fr

Degtyarev A, Gurevich YU, Narendran P, Veanes M, Voronkov A (2000) Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor Comput Sci 243:167–184MathSciNetMATHCrossRef

Doner JE (1965) Decidability of the weak second-order theory of two successors. Not Am Math Soc 12:365–468

Doner JE (1970) Tree acceptors and some of their applications. J Comput Syst Sci 4:406–451MathSciNetMATHCrossRef

Esik Z, Liu G (2007) Fuzzy tree automata. Fuzzy Sets Syst 158:1450–1460MathSciNetMATHCrossRef

Inagaki Y, Fukumura T (1975) On the description of fuzzy meaning of context-free language. In: Fuzzy sets and their applications to cognitive and decision processes. Proc. U.S. Japan Seminar, University of California, Berkeley, CA, 1974, Academic Press, New York, pp 301–328

Gallagher JP, Puebla G (2002) Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In: PADL 2002, pp 243–261

Gecseg F, Steinby M (1984) Tree automata. Akademiai Kiado, Budapest

Ghorani M, Zahedi MM (2011) Characterizations of complete residuated lattice-valued finite tree automata. Fuzzy Sets Syst 199:28–46CrossRef

Gilleron R, Tison S, Tommasi M (1993) Solving systems of set constraints using tree automata. Lect Notes Comput Sci 665:505–514MathSciNetCrossRef

Gori M, Petrosino A (2004) Encoding nondeterministic fuzzy tree automata into recursive neural networks. IEEE Trans Neural Netw 156(6):1435–1449CrossRef

Hopcroft JE, Motwani R, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, New york

Lee ET (1982) Fuzzy tree automata and syntactic pattern recognition. IEEE Transactions On Pattern Analysis And Machine Intelligence PAMI-4:445–449

Lei HX, Li Y (2007) Minimization of states in automata theory based on finite lattice-ordered monoids. Inf Sci 177:1413–1421MathSciNetMATHCrossRef

Li YM, Pedrycz W (2007) Minimization of lattice finite automata and its application to the decomposition of lattice languages. Fuzzy Sets Syst 158(13):1423–1436MathSciNetMATHCrossRef

Lu X, Shang Y, Lu R (2011) Automata theory based on lattice-ordered semirings. Soft Comput 15:269–280MATHCrossRef

Malik DS, Mordeson JN (2000) Fuzzy discrete structures. Physica-Verlag, New York

Mockor J (2002) Semigroup homomorphisms and fuzzy automata. Soft Comput 6:422–427MATHCrossRef

Moghari S, Zahedi MM, Ameri R (2011) New direction in fuzzy tree automata. Iran J Fuzzy Syst 8(5):59–68MathSciNet

Mordeson JN, Malik DS (2002) Fuzzy automata and languages: theory and applications. Chapman & Hall CRC, London, BocaRaton

Pavelka J (1979) On fuzzy logic I: many-valued rules of inferences. Z Math Logik Grundlagen Math 25:45–52MathSciNetMATHCrossRef

Pavelka J (1979) On fuzzy logic II: enriched residuated lattices and semantics of propositional calculi. Z Math Logik Grundlagen Math 25:119–134MathSciNetMATHCrossRef

Pavelka J (1979) On fuzzy logic III: semantical completeness of some many-valued propositional calculi. Z Math Logik Grundlagen Math 25:447–464MathSciNetMATHCrossRef

Qiu DW (2001) Automata theory based on completed residuated lattice-valued logic (I). Sci China Ser F 44(6):419–429MathSciNet

Qiu DW (2002) Automata theory based on completed residuated lattice-valued logic (II). Sci China Ser F 45(6):442–452MathSciNetMATH

Qiu DW (2004) Characterizations of fuzzy finite automata. Fuzzy Sets Syst 141:391–414MATHCrossRef

Qiu DW (2006) Pumping lemma in automata theory based on complete residuated lattice- valued logic: a note. Fuzzy Sets Syst 157:2128–2138MATHCrossRef

Qiu DW (2007) A note on Trillas CHC models. Artif Intell 171:239–254MATHCrossRef

Thatcher JW, Wright JB (1968) Generalized finite automata with an application to a decision problem of second-order logic. Math Syst Theory 2:57–82MathSciNetCrossRef

Shang Y, Lu R (2007) Semirings and pseudo MV algebras. Soft Comput 11:847–853MATHCrossRef

Wu L, Qiu DW (2010) Automata theory based on completed residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161:1635–1656MathSciNetMATHCrossRef

Xing HY, Qiu DW, Liu FC (2009) Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst 160:1125–1140MathSciNetMATHCrossRef

Xing HY, Qiu DW, Liu FC, Fan ZJ (2007) Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 158:1407–1422MathSciNetMATHCrossRef

Xing HY, Qiu DW (2009) Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 160:1141–1151MathSciNetMATHCrossRef

Ying MS (1991) A new approach for fuzzy topology (I). Fuzzy Sets Syst 39:303–321MATHCrossRef

Ying MS (1992) A new approach for fuzzy topology (II). Fuzzy Sets Syst 47:221–232MATHCrossRef

Ying MS (1993) A new approach for fuzzy topology (III). Fuzzy Sets Syst 55:193–207MATHCrossRef

Ying MS (1993) Fuzzifying topology based on complete residuated lattice valued logic (I). Fuzzy Sets Syst 56:337–373MATHCrossRef

Titel: Algebraic properties of complete residuated lattice valued tree automata
verfasst von: M. Ghorani
M. M. Zahedi
R. Ameri
Publikationsdatum: 01.10.2012
Verlag: Springer-Verlag
Erschienen in: Soft Computing / Ausgabe 10/2012
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-012-0856-y

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 10/2012

Modelling experts’ attitudes in group decision making

On mixed fuzzy topological spaces and countability

Fast parallel genetic programming: multi-core CPU versus many-core GPU

Dynamic effect algebras and their representations

The stable topology for residuated lattices

Bounded BCK-algebras of fractions and maximal BCK-algebra of quotients

Premium Partner