CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Conversion of Finite Automata to Fuzzy Automata for string comparison

by Dr. V. Ramaswamy, H. A. Girijamma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 37 - Number 8
Year of Publication: 2012
Authors: Dr. V. Ramaswamy, H. A. Girijamma
10.5120/4625-6647

Dr. V. Ramaswamy, H. A. Girijamma . Conversion of Finite Automata to Fuzzy Automata for string comparison. International Journal of Computer Applications. 37, 8 ( January 2012), 1-4. DOI=10.5120/4625-6647

@article{ 10.5120/4625-6647,
author = { Dr. V. Ramaswamy, H. A. Girijamma },
title = { Conversion of Finite Automata to Fuzzy Automata for string comparison },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 37 },
number = { 8 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume37/number8/4625-6647/ },
doi = { 10.5120/4625-6647 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:23:45.703695+05:30
%A Dr. V. Ramaswamy
%A H. A. Girijamma
%T Conversion of Finite Automata to Fuzzy Automata for string comparison
%J International Journal of Computer Applications
%@ 0975-8887
%V 37
%N 8
%P 1-4
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a method has been presented to convert finite automaton to fuzzy automaton as fuzzy automaton is better than finite automaton for strings comparison when individual levels of similarity for particular pairs of symbols or sequences of symbols are defined. A finite automaton is useful in determining whether a given string is accepted or not whereas fuzzy automaton determines the extent to which the string is accepted.

References
  1. John N. Mordeson, Davender S. Malik, Fuzzy Automata and Languages: Theory and Applications, 2002-03-19.
  2. Jiri Mockor, Fuzzy and Non deterministic Automata, Research Report No. 8, Institute for Research and Applications of Fuzzy Modeling, University of Ostrava, Chech Republic, 1999.
  3. Dr. V. Ramaswamy, Girijamma.H. A., Characterization of Fuzzy Regular Languages International Journal of Computer Science and Network Security, VOL 8, No. 12, December 2008.
  4. Dr. V. Ramaswamy, Girijamma.H. A., An extension of Myhill Nerode theorem for fuzzy automata, Advances in Fuzzy Mathematics, Research India Publications, ISSN 0973-533X Volume 4, Number 1 (2009).
  5. John E Hopcroft & Jefrey D. Ullman, Introduction to Automata Theory, Languages and Computation. Narosa publishing house, 1987.
  6. George J. Klir, Bo Yuan, Fuzzy sets and fuzzy logic Theory and Applications, Prentice – Hall of India Pvt. Ltd, 1997.
Index Terms

Computer Science
Information Sciences

Keywords

Finite Automata Fuzzy Automata string comparison Hamming distance

Powered by PhDFocusTM