메뉴 건너뛰기




Volumn 275, Issue , 2014, Pages 168-198

Reduction of fuzzy automata by means of fuzzy quasi-orders

Author keywords

Afterset automaton; Fuzzy automaton; Fuzzy discrete event system; Fuzzy quasi order; Fuzzy relation equation; State reduction

Indexed keywords

AUTOMATA THEORY; DISCRETE EVENT SIMULATION;

EID: 84900806170     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.02.028     Document Type: Article
Times cited : (37)

References (88)
  • 1
    • 0002637196 scopus 로고
    • Fuzzy relational products as a tool for analysis and synthesis of the behaviour of complex natural and artificial systems
    • S.K. Wang, P.P. Chang, Plenum Press New York
    • W. Bandler, and L.J. Kohout Fuzzy relational products as a tool for analysis and synthesis of the behaviour of complex natural and artificial systems S.K. Wang, P.P. Chang, Fuzzy Sets: Theory and Application to Policy Analysis and Information Systems 1980 Plenum Press New York 341 367
    • (1980) Fuzzy Sets: Theory and Application to Policy Analysis and Information Systems , pp. 341-367
    • Bandler, W.1    Kohout, L.J.2
  • 2
    • 0037116477 scopus 로고    scopus 로고
    • On quotient machines of a fuzzy automaton and the minimal machine
    • N.C. Basak, and A. Gupta On quotient machines of a fuzzy automaton and the minimal machine Fuzzy Sets Syst. 125 2002 223 229
    • (2002) Fuzzy Sets Syst. , vol.125 , pp. 223-229
    • Basak, N.C.1    Gupta, A.2
  • 5
    • 0002919399 scopus 로고    scopus 로고
    • A similarity-based generalization of fuzzy orderings preserving the classical axioms
    • U. Bodenhofer A similarity-based generalization of fuzzy orderings preserving the classical axioms Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 8 2000 593 610
    • (2000) Int. J. Uncertain. Fuzz. Knowl.-Based Syst. , vol.8 , pp. 593-610
    • Bodenhofer, U.1
  • 6
    • 0038548144 scopus 로고    scopus 로고
    • Representations and constructions of similarity-based fuzzy orderings
    • U. Bodenhofer Representations and constructions of similarity-based fuzzy orderings Fuzzy Sets Syst. 137 2003 113 136
    • (2003) Fuzzy Sets Syst. , vol.137 , pp. 113-136
    • Bodenhofer, U.1
  • 7
    • 33847258860 scopus 로고    scopus 로고
    • A compendium of fuzzy weak orders: Representations and constructions
    • U. Bodenhofer, B. De Baets, and J. Fodor A compendium of fuzzy weak orders: representations and constructions Fuzzy Sets Syst. 158 2007 811 829
    • (2007) Fuzzy Sets Syst. , vol.158 , pp. 811-829
    • Bodenhofer, U.1    De Baets, B.2    Fodor, J.3
  • 8
    • 2942644489 scopus 로고    scopus 로고
    • A formal study of linearity axioms for fuzzy orderings
    • U. Bodenhofer, and F. Klawonn A formal study of linearity axioms for fuzzy orderings Fuzzy Sets Syst. 145 2004 323 354
    • (2004) Fuzzy Sets Syst. , vol.145 , pp. 323-354
    • Bodenhofer, U.1    Klawonn, F.2
  • 10
    • 0037653958 scopus 로고    scopus 로고
    • Finite nondeterministic automata: Simulation and minimality
    • C.S. Calude, E. Calude, and B. Khoussainov Finite nondeterministic automata: simulation and minimality Theor. Comput. Sci. 242 2000 219 235
    • (2000) Theor. Comput. Sci. , vol.242 , pp. 219-235
    • Calude, C.S.1    Calude, E.2    Khoussainov, B.3
  • 13
    • 33645838629 scopus 로고    scopus 로고
    • Observability and decentralized control of fuzzy discrete-event systems
    • Y.Z. Cao, and M.S. Ying Observability and decentralized control of fuzzy discrete-event systems IEEE Trans. Fuzzy Syst. 14 2006 202 216
    • (2006) IEEE Trans. Fuzzy Syst. , vol.14 , pp. 202-216
    • Cao, Y.Z.1    Ying, M.S.2
  • 16
    • 35248891351 scopus 로고    scopus 로고
    • Theoretical Study and Implementation of the Canonical Automaton
    • LIFAR, Université de Rouen
    • J.-M. Champarnaud, F. Coulon, Theoretical Study and Implementation of the Canonical Automaton, Technical Report AIA 2003.03, LIFAR, Université de Rouen, 2003.
    • (2003) Technical Report AIA 2003.03
    • Champarnaud, J.-M.1    Coulon, F.2
  • 17
    • 35248863375 scopus 로고    scopus 로고
    • NFA reduction algorithms by means of regular inequalities
    • Z. Ésik, Z. Fülöp, (Eds.)
    • J.-M. Champarnaud, F. Coulon, NFA reduction algorithms by means of regular inequalities, in: Z. Ésik, Z. Fülöp, (Eds.), DLT 2003, Lecture Notes in Computer Science, vol. 2710, 2003, pp. 194-205.
    • (2003) DLT 2003, Lecture Notes in Computer Science , vol.2710 , pp. 194-205
    • Champarnaud, J.-M.1    Coulon, F.2
  • 18
    • 6344231665 scopus 로고    scopus 로고
    • NFA reduction algorithms by means of regular inequalities
    • (erratum: Theoretical Computer Science 347 (2005) 437-40).
    • J.-M. Champarnaud, and F. Coulon NFA reduction algorithms by means of regular inequalities Theor. Comput. Sci. 327 2004 241 253 (erratum: Theoretical Computer Science 347 (2005) 437-40).
    • (2004) Theor. Comput. Sci. , vol.327 , pp. 241-253
    • Champarnaud, J.-M.1    Coulon, F.2
  • 19
    • 0141626514 scopus 로고    scopus 로고
    • New finite automaton constructions based on canonical derivatives
    • S. Yu, A. Paun, Lecture Notes in Computer Science Springer Berlin
    • J.-M. Champarnaud, and D. Ziadi New finite automaton constructions based on canonical derivatives S. Yu, A. Paun, CIAA 2000 Lecture Notes in Computer Science vol. 2088 2001 Springer Berlin 94 104
    • (2001) CIAA 2000 , vol.2088 , pp. 94-104
    • Champarnaud, J.-M.1    Ziadi, D.2
  • 20
    • 84956989442 scopus 로고    scopus 로고
    • s 2) space and time
    • A. Amir, G. Landau, Lecture Notes in Computer Science Springer Berlin
    • s 2) space and time A. Amir, G. Landau, CPM 2001 Lecture Notes in Computer Science vol. 2089 2001 Springer Berlin 157 168
    • (2001) CPM 2001 , vol.2089 , pp. 157-168
    • Champarnaud, J.-M.1    Ziadi, D.2
  • 21
    • 0347541064 scopus 로고    scopus 로고
    • Minimization algorithm of fuzzy finite automata
    • W. Cheng, and Z. Mo Minimization algorithm of fuzzy finite automata Fuzzy Sets Syst. 141 2004 439 448
    • (2004) Fuzzy Sets Syst. , vol.141 , pp. 439-448
    • Cheng, W.1    Mo, Z.2
  • 22
    • 34247276452 scopus 로고    scopus 로고
    • Fuzzy equivalence relations and their equivalence classes
    • M. Ćirić, J. Ignjatović, and S. Bogdanović Fuzzy equivalence relations and their equivalence classes Fuzzy Sets Syst. 158 2007 1295 1313
    • (2007) Fuzzy Sets Syst. , vol.158 , pp. 1295-1313
    • Ćirić, M.1    Ignjatović, J.2    Bogdanović, S.3
  • 24
    • 38149052102 scopus 로고    scopus 로고
    • Factorization of fuzzy automata
    • E. Csuhaj-Varju, and Z. Ésik, (Eds.)
    • M. Ćirić, A. Stamenković, J. Ignjatović, T. Petković, Factorization of fuzzy automata, in: E. Csuhaj-Varju, and Z. Ésik, (Eds.), FCT 2007, Lecture Notes in Computer Science, vol. 4639, 2007, pp. 213-225.
    • (2007) FCT 2007, Lecture Notes in Computer Science , vol.4639 , pp. 213-225
    • Ćirić, M.1
  • 26
    • 38149146967 scopus 로고
    • The cutting of compositions
    • B. De Baets, and E. Kerre The cutting of compositions Fuzzy Sets Syst. 62 1994 295 309
    • (1994) Fuzzy Sets Syst. , vol.62 , pp. 295-309
    • De Baets, B.1    Kerre, E.2
  • 27
    • 1342264195 scopus 로고    scopus 로고
    • Fuzzy modifiers based on fuzzy relations
    • M. De Cock, and E.E. Kerre Fuzzy modifiers based on fuzzy relations Inf. Sci. 160 2004 173 199
    • (2004) Inf. Sci. , vol.160 , pp. 173-199
    • De Cock, M.1    Kerre, E.E.2
  • 28
    • 0346969678 scopus 로고    scopus 로고
    • An efficient algorithm for computing bisimulation equivalence
    • A. Dovier, C. Piazza, and A. Policriti An efficient algorithm for computing bisimulation equivalence Theor. Comput. Sci. 311 2004 221 256
    • (2004) Theor. Comput. Sci. , vol.311 , pp. 221-256
    • Dovier, A.1    Piazza, C.2    Policriti, A.3
  • 29
    • 0345358528 scopus 로고    scopus 로고
    • From bisimulation to simulation: Coarsest partition problems
    • R. Gentilini, C. Piazza, and A. Policriti From bisimulation to simulation: coarsest partition problems J. Autom. Reasoning 31 2003 73 103
    • (2003) J. Autom. Reasoning , vol.31 , pp. 73-103
    • Gentilini, R.1    Piazza, C.2    Policriti, A.3
  • 30
    • 0002753240 scopus 로고
    • Commutative, residuated l-monoids
    • U. Höhle, E.P. Klement, Kluwer Academic Publishers Boston, Dordrecht
    • U. Höhle Commutative, residuated l-monoids U. Höhle, E.P. Klement, Non-Classical Logics and Their Applications to Fuzzy Subsets 1995 Kluwer Academic Publishers Boston, Dordrecht 53 106
    • (1995) Non-Classical Logics and Their Applications to Fuzzy Subsets , pp. 53-106
    • Höhle, U.1
  • 32
    • 35148813934 scopus 로고    scopus 로고
    • Determinization of fuzzy automata with membership values in complete residuated lattices
    • J. Ignjatović, M. Ćirić, and S. Bogdanović Determinization of fuzzy automata with membership values in complete residuated lattices Inf. Sci. 178 2008 164 180
    • (2008) Inf. Sci. , vol.178 , pp. 164-180
    • Ignjatović, J.1    Ćirić, M.2    Bogdanović, S.3
  • 35
    • 84937430795 scopus 로고    scopus 로고
    • Constructing NFAs by optimal use of positions in regular expressions
    • A. Apostolico, M. Takeda, Lecture Notes in Computer Science Springer Berlin
    • L. Ilie, and S. Yu Constructing NFAs by optimal use of positions in regular expressions A. Apostolico, M. Takeda, CPM 2002 Lecture Notes in Computer Science vol. 2373 2002 Springer Berlin 279 288
    • (2002) CPM 2002 , vol.2373 , pp. 279-288
    • Ilie, L.1    Yu, S.2
  • 36
    • 84956968672 scopus 로고    scopus 로고
    • Algorithms for computing small NFAs
    • in: K. Diks, et al., (Eds.)
    • L. Ilie, S. Yu, Algorithms for computing small NFAs, in: K. Diks, et al., (Eds.), MFCS 2002, Lecture Notes in Computer Science, vol. 2420, 2002, pp. 328-340.
    • (2002) MFCS 2002, Lecture Notes in Computer Science , vol.2420 , pp. 328-340
    • Ilie, L.1    Yu, S.2
  • 37
    • 0041387624 scopus 로고    scopus 로고
    • Reducing NFAs by invariant equivalences
    • L. Ilie, and S. Yu Reducing NFAs by invariant equivalences Theor. Comput. Sci. 306 2003 373 390
    • (2003) Theor. Comput. Sci. , vol.306 , pp. 373-390
    • Ilie, L.1    Yu, S.2
  • 38
    • 0141639607 scopus 로고    scopus 로고
    • Follow automata
    • L. Ilie, and S. Yu Follow automata Inf. Comput. 186 2003 140 162
    • (2003) Inf. Comput. , vol.186 , pp. 140-162
    • Ilie, L.1    Yu, S.2
  • 40
    • 26444573200 scopus 로고    scopus 로고
    • Reducing the size of NFAs by using equivalences and preorders
    • A. Apostolico, M. Crochemore, K. Park, (Eds.)
    • L. Ilie, R. Solis-Oba, S. Yu, Reducing the size of NFAs by using equivalences and preorders, in: A. Apostolico, M. Crochemore, K. Park, (Eds.), CPM 2005, Lecture Notes in Computer Science, vol. 3537, 2005, pp. 310-321.
    • (2005) CPM 2005, Lecture Notes in Computer Science , vol.3537 , pp. 310-321
    • Ilie, L.1    Solis-Oba, R.2    Yu, S.3
  • 41
    • 0027796975 scopus 로고
    • Minimal NFA problems are hard
    • T. Jiang, and B. Ravikumar Minimal NFA problems are hard SIAM J. Comput. 22 6 1993 1117 1141
    • (1993) SIAM J. Comput. , vol.22 , Issue.6 , pp. 1117-1141
    • Jiang, T.1    Ravikumar, B.2
  • 42
    • 0014825089 scopus 로고
    • On the state minimization of nondeterministic finite automata
    • T. Kameda, and P. Weiner On the state minimization of nondeterministic finite automata IEEE Trans. Comput. C-19 7 1970 617 627
    • (1970) IEEE Trans. Comput. , vol.19 C- , Issue.7 , pp. 617-627
    • Kameda, T.1    Weiner, P.2
  • 43
    • 0025432462 scopus 로고
    • CCS expressions, finite state processes, and three problems of equivalence
    • P.C. Kannellakis, and S.A. Smolka CCS expressions, finite state processes, and three problems of equivalence Inf. Comput. 86 1990 43 68
    • (1990) Inf. Comput. , vol.86 , pp. 43-68
    • Kannellakis, P.C.1    Smolka, S.A.2
  • 44
    • 35748958437 scopus 로고    scopus 로고
    • Diagnosability of fuzzy discrete event systems
    • E. Kilic Diagnosability of fuzzy discrete event systems Inf. Sci. 178 2008 858 870
    • (2008) Inf. Sci. , vol.178 , pp. 858-870
    • Kilic, E.1
  • 46
    • 33845920084 scopus 로고    scopus 로고
    • Minimization of states in automata theory based on finite lattice-ordered monoids
    • H. Lei, and Y.M. Li Minimization of states in automata theory based on finite lattice-ordered monoids Inf. Sci. 177 2007 1413 1421
    • (2007) Inf. Sci. , vol.177 , pp. 1413-1421
    • Lei, H.1    Li, Y.M.2
  • 47
    • 24944554023 scopus 로고    scopus 로고
    • Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids
    • Y.M. Li, and W. Pedrycz Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids Fuzzy Sets Syst. 156 2005 68 92
    • (2005) Fuzzy Sets Syst. , vol.156 , pp. 68-92
    • Li, Y.M.1    Pedrycz, W.2
  • 49
    • 0036685411 scopus 로고    scopus 로고
    • Modeling and control of fuzzy discrete event systems
    • F. Lin, and H. Ying Modeling and control of fuzzy discrete event systems IEEE Trans. Man Syst. Cybern. - Part B 32 2002 408 415
    • (2002) IEEE Trans. Man Syst. Cybern. - Part B , vol.32 , pp. 408-415
    • Lin, F.1    Ying, H.2
  • 51
    • 49949112687 scopus 로고    scopus 로고
    • Decentralized supervisory control of fuzzy discrete event systems
    • F. Liu, and D.W. Qiu Decentralized supervisory control of fuzzy discrete event systems Eur. J. Control 3 2008 234 243
    • (2008) Eur. J. Control , vol.3 , pp. 234-243
    • Liu, F.1    Qiu, D.W.2
  • 52
    • 65549092880 scopus 로고    scopus 로고
    • Diagnosability of fuzzy discrete event systems: A fuzzy approach
    • F. Liu, and D.W. Qiu Diagnosability of fuzzy discrete event systems: a fuzzy approach IEEE Trans. Fuzzy Syst. 17 2 2009 372 384
    • (2009) IEEE Trans. Fuzzy Syst. , vol.17 , Issue.2 , pp. 372-384
    • Liu, F.1    Qiu, D.W.2
  • 53
    • 49849101399 scopus 로고    scopus 로고
    • The relationship of controllability between classical and fuzzy discrete-event systems
    • J.P. Liu, and Y.M. Li The relationship of controllability between classical and fuzzy discrete-event systems Inf. Sci. 178 2008 4142 4151
    • (2008) Inf. Sci. , vol.178 , pp. 4142-4151
    • Liu, J.P.1    Li, Y.M.2
  • 54
    • 0005336501 scopus 로고
    • Forward and backward simulations: Part I. Untimed systems
    • N. Lynch, and F. Vaandrager Forward and backward simulations: Part I. Untimed systems Inf. Comput. 121 1995 214 233
    • (1995) Inf. Comput. , vol.121 , pp. 214-233
    • Lynch, N.1    Vaandrager, F.2
  • 55
    • 0033079896 scopus 로고    scopus 로고
    • Minimization of fuzzy finite automata
    • D.S. Malik, J.N. Mordeson, and M.K. Sen Minimization of fuzzy finite automata Inf. Sci. 113 1999 323 330
    • (1999) Inf. Sci. , vol.113 , pp. 323-330
    • Malik, D.S.1    Mordeson, J.N.2    Sen, M.K.3
  • 56
    • 33746899177 scopus 로고    scopus 로고
    • Fair testing revisited: A process-algebraic characterisation of conflicts
    • F. Wang, (Ed.)
    • R. Malik, D. Streader, S. Reeves, fair testing revisited: a process-algebraic characterisation of conflicts, in: F. Wang, (Ed.), ATVA 2004, Lecture Notes in Computer Science, vol. 3299, 2004, pp. 120-134.
    • (2004) ATVA 2004, Lecture Notes in Computer Science , vol.3299 , pp. 120-134
    • Malik, R.1    Streader, D.2    Reeves, S.3
  • 57
    • 0039893762 scopus 로고    scopus 로고
    • A new algorithm of the state-minimization for the nondeterministic finite automata
    • B.F. Melnikov A new algorithm of the state-minimization for the nondeterministic finite automata Korean J. Comput. Appl. Math. 6 2 1999 277 290
    • (1999) Korean J. Comput. Appl. Math. , vol.6 , Issue.2 , pp. 277-290
    • Melnikov, B.F.1
  • 58
    • 0041080790 scopus 로고    scopus 로고
    • Once more about the state-minimization of the nondeterministic finite automata
    • B.F. Melnikov Once more about the state-minimization of the nondeterministic finite automata Korean J. Comput. Appl. Math. 7 3 2000 655 662
    • (2000) Korean J. Comput. Appl. Math. , vol.7 , Issue.3 , pp. 655-662
    • Melnikov, B.F.1
  • 59
    • 0003276135 scopus 로고
    • A calculus of communicating systems
    • G. Goos, J. Hartmanis, Springer
    • R. Milner A calculus of communicating systems G. Goos, J. Hartmanis, Lecture Notes in Computer Science vol. 92 1980 Springer
    • (1980) Lecture Notes in Computer Science , vol.92
    • Milner, R.1
  • 63
    • 0023566630 scopus 로고
    • Three partition refinement algorithms
    • R. Paige, and R.E. Tarjan Three partition refinement algorithms SIAM J. Comput. 16 6 1987 973 989
    • (1987) SIAM J. Comput. , vol.16 , Issue.6 , pp. 973-989
    • Paige, R.1    Tarjan, R.E.2
  • 64
    • 84945924340 scopus 로고
    • Concurrency and automata on infinite sequences
    • P. Deussen, Lecture Notes in Computer Science Springer-Verlag Karlsruhe, Germany
    • D. Park Concurrency and automata on infinite sequences P. Deussen, Proc. 5th GI Conf Lecture Notes in Computer Science vol. 104 1981 Springer-Verlag Karlsruhe, Germany 167 183
    • (1981) Proc. 5th GI Conf , vol.104 , pp. 167-183
    • Park, D.1
  • 65
    • 0346280058 scopus 로고    scopus 로고
    • Finite L-fuzzy machines
    • K. Peeva Finite L-fuzzy machines Fuzzy Sets Syst. 141 2004 415 437
    • (2004) Fuzzy Sets Syst. , vol.141 , pp. 415-437
    • Peeva, K.1
  • 66
    • 4544227117 scopus 로고    scopus 로고
    • Fuzzy function as an approximate solution to a system of fuzzy relation equations
    • I. Perfilieva Fuzzy function as an approximate solution to a system of fuzzy relation equations Fuzzy Sets Syst. 147 2004 363 383
    • (2004) Fuzzy Sets Syst. , vol.147 , pp. 363-383
    • Perfilieva, I.1
  • 67
    • 4544227907 scopus 로고    scopus 로고
    • Solvability and approximate solvability of fuzzy relation equations
    • I. Perfilieva, and S. Gottwald Solvability and approximate solvability of fuzzy relation equations Int. J. Gen. Syst. 32 2003 361 372
    • (2003) Int. J. Gen. Syst. , vol.32 , pp. 361-372
    • Perfilieva, I.1    Gottwald, S.2
  • 68
    • 34249302022 scopus 로고    scopus 로고
    • System of fuzzy relation equations as a continuous model of IF-THEN rules
    • I. Perfilieva, and V. Novák System of fuzzy relation equations as a continuous model of IF-THEN rules Inf. Sci. 177 2007 3218 3227
    • (2007) Inf. Sci. , vol.177 , pp. 3218-3227
    • Perfilieva, I.1    Novák, V.2
  • 69
    • 27744503293 scopus 로고    scopus 로고
    • Congruences and homomorphisms of fuzzy automata
    • T. Petković Congruences and homomorphisms of fuzzy automata Fuzzy Sets Syst. 157 2006 444 458
    • (2006) Fuzzy Sets Syst. , vol.157 , pp. 444-458
    • Petković, T.1
  • 70
    • 0345848124 scopus 로고    scopus 로고
    • Automata theory based on completed residuated lattice-valued logic (I)
    • D.W. Qiu Automata theory based on completed residuated lattice-valued logic (I) Sci. China Ser. F 44 6 2001 419 429
    • (2001) Sci. China Ser. F , vol.44 , Issue.6 , pp. 419-429
    • Qiu, D.W.1
  • 71
    • 0345848127 scopus 로고    scopus 로고
    • Automata theory based on completed residuated lattice-valued logic (II)
    • D.W. Qiu Automata theory based on completed residuated lattice-valued logic (II) Sci. China Ser. F 45 6 2002 442 452
    • (2002) Sci. China Ser. F , vol.45 , Issue.6 , pp. 442-452
    • Qiu, D.W.1
  • 72
    • 0348170841 scopus 로고    scopus 로고
    • Characterizations of fuzzy finite automata
    • D.W. Qiu Characterizations of fuzzy finite automata Fuzzy Sets Syst. 141 2004 391 414
    • (2004) Fuzzy Sets Syst. , vol.141 , pp. 391-414
    • Qiu, D.W.1
  • 73
    • 13644254167 scopus 로고    scopus 로고
    • Supervisory control of fuzzy discrete event systems: A formal approach
    • D.W. Qiu Supervisory control of fuzzy discrete event systems: a formal approach IEEE Trans. Syst. Man Cybern - Part B 35 2005 72 88
    • (2005) IEEE Trans. Syst. Man Cybern - Part B , vol.35 , pp. 72-88
    • Qiu, D.W.1
  • 74
    • 33744917237 scopus 로고    scopus 로고
    • Pumping lemma in automata theory based on complete residuated lattice-valued logic: A note
    • D.W. Qiu Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note Fuzzy Sets Syst. 157 2006 2128 2138
    • (2006) Fuzzy Sets Syst. , vol.157 , pp. 2128-2138
    • Qiu, D.W.1
  • 75
    • 67149108312 scopus 로고    scopus 로고
    • Fuzzy discrete-event systems under fuzzy observability and a test algorithm
    • D.W. Qiu, and F.C. Liu Fuzzy discrete-event systems under fuzzy observability and a test algorithm IEEE Trans. Fuzzy Syst. 17 3 2009 578 589
    • (2009) IEEE Trans. Fuzzy Syst. , vol.17 , Issue.3 , pp. 578-589
    • Qiu, D.W.1    Liu, F.C.2
  • 76
    • 41349108646 scopus 로고    scopus 로고
    • Generalizing the PaigeTarjan algorithm by abstract interpretation
    • F. Ranzato, and F. Tapparo Generalizing the PaigeTarjan algorithm by abstract interpretation Inf. Comput. 206 2008 620 651
    • (2008) Inf. Comput. , vol.206 , pp. 620-651
    • Ranzato, F.1    Tapparo, F.2
  • 77
    • 0004525559 scopus 로고    scopus 로고
    • Towards a unified view of bisimulation: A comparative study
    • M. Roggenbach, and M. Majster-Cederbaum Towards a unified view of bisimulation: a comparative study Theor. Comput. Sci. 238 2000 81 130
    • (2000) Theor. Comput. Sci. , vol.238 , pp. 81-130
    • Roggenbach, M.1    Majster-Cederbaum, M.2
  • 78
    • 0016900196 scopus 로고
    • Resolution of composite fuzzy relation equations
    • E. Sanchez Resolution of composite fuzzy relation equations Inf. Control 30 1976 38 48
    • (1976) Inf. Control , vol.30 , pp. 38-48
    • Sanchez, E.1
  • 81
    • 77950458351 scopus 로고    scopus 로고
    • Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
    • L.H. Wu, and D.W. Qiu Automata theory based on complete residuated lattice-valued logic: reduction and minimization Fuzzy Sets Syst. 161 2010 1635 1656
    • (2010) Fuzzy Sets Syst. , vol.161 , pp. 1635-1656
    • Wu, L.H.1    Qiu, D.W.2
  • 82
    • 60749126623 scopus 로고    scopus 로고
    • Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic
    • H. Xing, and D.W. Qiu Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic Fuzzy Sets Syst. 160 2009 1141 1151
    • (2009) Fuzzy Sets Syst. , vol.160 , pp. 1141-1151
    • Xing, H.1    Qiu, D.W.2
  • 83
    • 67349144636 scopus 로고    scopus 로고
    • Automata theory based on complete residuated lattice-valued logic: A categorical approach
    • H. Xing, and D.W. Qiu Automata theory based on complete residuated lattice-valued logic: a categorical approach Fuzzy Sets Syst. 160 2009 2416 2428
    • (2009) Fuzzy Sets Syst. , vol.160 , pp. 2416-2428
    • Xing, H.1    Qiu, D.W.2
  • 84
    • 60749109783 scopus 로고    scopus 로고
    • Automata theory based on complete residuated lattice-valued logic: Pushdown automata
    • H. Xing, D.W. Qiu, and F.C. Liu Automata theory based on complete residuated lattice-valued logic: pushdown automata Fuzzy Sets Syst. 160 2009 1125 1140
    • (2009) Fuzzy Sets Syst. , vol.160 , pp. 1125-1140
    • Xing, H.1    Qiu, D.W.2    Liu, F.C.3
  • 85
    • 34248206740 scopus 로고    scopus 로고
    • Equivalence in automata theory based on complete residuated lattice-valued logic
    • H. Xing, D.W. Qiu, F.C. Liu, and Z.J. Fan Equivalence in automata theory based on complete residuated lattice-valued logic Fuzzy Sets Syst. 158 2007 1407 1422
    • (2007) Fuzzy Sets Syst. , vol.158 , pp. 1407-1422
    • Xing, H.1    Qiu, D.W.2    Liu, F.C.3    Fan, Z.J.4
  • 86
    • 0002700117 scopus 로고    scopus 로고
    • Regular languages
    • G. Rozenberg, A. Salomaa, Springer-Verlag Berlin - Heidelberg
    • S. Yu Regular languages G. Rozenberg, A. Salomaa, Handbook of Formal Languages vol. 1 1997 Springer-Verlag Berlin - Heidelberg 41 110
    • (1997) Handbook of Formal Languages , vol.1 , pp. 41-110
    • Yu, S.1
  • 87
    • 18144388681 scopus 로고    scopus 로고
    • Toward a generalized theory of uncertainty (GTU) - An outline
    • L.A. Zadeh Toward a generalized theory of uncertainty (GTU) - an outline Inf. Sci. 172 2005 1 40
    • (2005) Inf. Sci. , vol.172 , pp. 1-40
    • Zadeh, L.A.1
  • 88
    • 42749097020 scopus 로고    scopus 로고
    • Is there a need for fuzzy logic?
    • L.A. Zadeh Is there a need for fuzzy logic? Inf. Sci. 178 2008 2751 2779
    • (2008) Inf. Sci. , vol.178 , pp. 2751-2779
    • Zadeh, L.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.