Abstract
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity cannot be handled by usual searching algorithms.We present sample situations, which would use this kind of searching. Then we define a fuzzy automaton, and some basic constructions we need for our purposes. We continue with definition of our fuzzy automaton based approximate string matching algorithm, and add some notes to fuzzy-trellis construction which can be used for approximate searching.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asveld, P.R.J.: A bibliography on fuzzy automata, grammars and language. Bulletin of the European Association for Theoretical Computer Science 58, 187–196 (1996)
Bělohlávek, R.: Fuzzy Relational Systems: Foundations and Principles. Kluwer Academic Publishers, Dordrecht (2002)
Gruska, J.: Foundations of Computing. International Thomson Computer Press (1997)
Kurtz, S.: Approximate string searching under weighted edit distance. In: Proceedings of the 3rd South American Workshop oh String Processing, pp. 156–170. Carton University Press (1996)
Melichar, B., Holub, J.: 6D classification of pattern matching problem. In: Proceedings of the Prague Stringology Club Workshop, pp. 24–32 (1997)
Močkoř, J.: Minimization of fuzzy automata. RSV FMPE (1982) (in Czech)
Muthukrishnan, S.: New results and open problems related to non-standard stringology. In: Proceedings of the 6th Combinatorial Pattern Matching Conference. LNCS, vol. 937, pp. 298–317. Springer, Espoo (1995)
Nguyen, H.T., Walker, E.A.: A First Course in Fuzzy Logic, 2nd edn. Chapman & Hall/CRC, Boca Raton (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Snášel, V., Keprt, A., Abraham, A., Hassanien, A.E. (2009). Approximate String Matching by Fuzzy Automata. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00563-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-00563-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00562-6
Online ISBN: 978-3-642-00563-3
eBook Packages: EngineeringEngineering (R0)