PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Different Types of Linear Fuzzy Cellular Automata and their Applications

Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
A linear array of interconnected fuzzy automaton is called linear fuzzy cellular automaton. It is shown that the language class of linear fuzzy cellular automata strictly contains the language class of linear cellular automata. This justifies the wide spread use of linear fuzzy cellular automaton as is evident from the literature. In this paper a special type of cellular automaton (CA) model is investigated. This CA model computes effect due to interaction of neighboring cells and effect due to external disturbance on the cells simultaneously. The transition due to both the effects may be represented by a single function which is the composition of two functions. Further it is shown that the class of language accepted by linear hybrid fuzzy cellular automata is included in the class of language accepted by linear hybrid fuzzy cellular automata with external input(HFCAI). HFCAI is useful for computing growth in evolutionary systems which are also affected by external cause.
Słowa kluczowe
Wydawca
Rocznik
Strony
185--205
Opis fizyczny
bibliogr. 17 poz., tab.
Twórcy
autor
autor
Bibliografia
  • [1] Asveld,Peter R. J. : Algebraic aspects of families of fuzzy languages, Theoretical Computer Science 293 (2003)417-445
  • [2] Basu,S., Basu,S.: Hybrid Fuzzy one dimensional Cellular Automaton with External Input, Proceedings of the 3rd Indian International Conference on Artificial Intelligence (IICAI-07), India, December 2007.
  • [3] Belohlavek,R.: Determinism and fuzzy automata, Information Sciences 143 (2002) 205-209
  • [4] Buchholz,T., Kutrib.M., et al :On Interacting Automata with Limited Nondeterminism, Fundamenta Informat-icae 52 (2002) 15-38
  • [5] Cattaneo,G., Flocchini,P., Mauri,G., Vogliotti,C.Q., Santoro,N. : Cellular Automata in Fuzzy Backgrounds, Physica D, Volume 105, Number 1 (16) (15 June 1997) 105- 120
  • [6] Giammarresi,D., Restivo,A.: Two Dimensional Languages, Handbook of Formal Languages; edited by G.Rozenberg and A.Salomaa, Springer Verlag (1997)
  • [7] Maji,R, Das,C: Knowledge Discovery in Distributed Biological Datasets Using Fuzzy Cellular Automata, IEEE Proceedings of 3rd International Conference on Intelligent Sensing and Information Processing (ICISIP-05) (December 2005) 164-169
  • [8] Maji,R, Nandi,R., Pal Chaudhuri,P.: Application of Fuzzy Cellular Automata (FCA) for Modeling Tree Structured Pattern Classifier, Proceedings of 1st Indian International Conference on Artificial Intelligence (IICAI-03), India (December, 2003) 1220-1233
  • [9] Maji,R, Pal Chaudhuri,R: Fuzzy Cellular Automata for Modeling Pattern Classifier, IEICE Transactions on Information and Systems (2005) E88-D(4) 691- 702
  • [10] Maji,P, Pal Chaudhuri,P. : RBFFCA: A Hybrid Pattern Classifier Using Radial Basis Function and Fuzzy Cellular Automata, Fundamenta Informaticae, 78(3) (2007) 369-396
  • [11] Merkle,D., Worsch,T.: Formal language recognition by stochastic cellular automata, Fundamenta Informaticae 52 (2002) 183-201
  • [12] MockorJ.: Fuzzy and non-deterministic automata, Soft Computing 03 (1999) 221- 226
  • [13] Smith III, A. R.: Real - time language recognition by one-dimensional cellular automata, Journal of Computer and System Sciences 6 (1972) 233-253
  • [14] Von NeumannJ.: Theory of Self-Reproducing Automata, University of Illinois Press, Illinois (1966) Edited and completed by A.W.Burks
  • [15] Wolfram,S. : Theory and Applications of Cellular Automata, World Scientific Singapore (1986)
  • [16] Wolfram,S. : A New Kind of Science, Wolfram Media (2002)
  • [17] Zadeh,L. A.: Fuzzy Sets. Information and Control, 8 (1965) 338-353
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS5-0018-0036
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.