1. Conversion of Finite Automata to Fuzzy Automata for string comparison
- Author
-
H. A. Girijamma and V. Ramaswamy
- Subjects
Discrete mathematics ,TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES ,Nested word ,Finite-state machine ,Similarity (geometry) ,Theoretical computer science ,Computer science ,String (computer science) ,ω-automaton ,Nonlinear Sciences::Cellular Automata and Lattice Gases ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Deterministic finite automaton ,Automata theory ,Quantum finite automata ,Computer Science::Formal Languages and Automata Theory - 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.
- Published
- 2012