Assimilation of general neutrosophic automata

Document Type : Original Article

Authors

1 Dept.of Mathematics, Behbahan Khatam Alanbia University of Technology, Khuzestan, Iran.

2 Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran

3 Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran

Abstract

In this paper , we at first define the general neutrosophic automaton by considering the notion of the neutrosophic set . Then, for the general neutrosophic automaton , we give the notion of assimilation . Then , we present an algorithm to detect the assimilation relationship between two automata and calculate its time complexity . We also show that the union of assimilations on two general neutrosophic automata is itself assimilation between them . In addition , we prove that if there is an assimilation relationship between two general neutrosophic automata , then the language of the two automatons is equal .
Next , by considering the largest assimilation between general neutrosophic automata , we present a quotient general neutrosophic automaton and show that this automaton is a minimal general neutrosophic automaton that preserves the language of the automaton . To make the concepts clearer , we give some examples .

Keywords

References

[1] N. C. Basak, A. Gupta, ”On quotient machines of a fuzzy automaton and the minimal machine.” Fuzzy Sets and Systems 125.2 (2002): 223-229.
 
[2] W. Cheng, Z. W. Mo, ”Minimization algorithm of fuzzy finite automata.” Fuzzy Sets and Systems 141.3 (2004): 439-448.
 
[3] M. Doostfatemeh, S. C. Kremer, New directions in fuzzy automata, International Journal of Approximate Reasoning, 38.2 (2005), 175-214.
 
[4] M. R. Gary, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, (1979).
 
[5] M. Ghorani, S. Moghari, (2021), Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Journal of Applied Mathematics and Computing, in press, https://doi.org/10.1007/s12190-021-01529-6
 
[6] A. Mateescu, et al. ”Lexical analysis with a simple finite-fuzzy-automaton model.” J. UCS The Journal of Universal Computer Science. Springer Berlin Heidelberg, 1996. 292-311.
 
[7] F. Samarandche, Neutrosophy, Neutosophic Probability, Sets and Logic, Amer. Res. Press, Rehoboth, 2006.
 
[8] M. Shamsizadeh, M. M. Zahedi, Bisimulation of type 2 for BL- general fuzzy automata, Soft Computing, 23 (2019), 9843-9852.
 
[9] M. Shamsizadeh, M. M. Zahedi, Kh. Abolpour, Admissible Partition for BL- general fuzzy automata, Iranian Journal of Fuzzy Systems, 15 (2018), 79-90.
 
[10] M. Shamsizadeh, M. M. Zahedi, Kh. Abolpour, Bisimulation for BL-general fuzzy automata, Iranian Journal of Fuzzy Systems (2016).
 
[11] S. S. Skiena, The algorithm design manual: Text. Vol. 1. Springer Science & Business Media, 1998.
 
[12] W.G. Wee, (1967), On generalization of adaptive algorithm and application of the fuzzy sets concept to pattern classification. Ph.D. thesis, Purdue University, Lafayette, IN.
 
[13] S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa(Eds.), Hand book of Formal Languages, vol.1, Springer-Verlag, Berlin, Heidelberg, 1997, 41–105.
 
[14] L. A. Zadeh, Fuzzy sets, Information and control, 8 (1965), 338-353.

Files

History

  • Receive Date: 04 April 2022
  • Revise Date: 07 May 2022
  • Accept Date: 15 June 2022

Share

How to cite

Statistics