109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-001-05-0292 27126 Research Article G.2 - DISCRETE MATHEMATICS Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model Mateescu Alexandru alexandru_mateescu@fake_email.com 1 Salomaa Arto 1 Salomaa Kai 2 Yu Sheng 3 Academy of Finland and University of Turku, Department of Mathematics, Turku, Finland Academy of Finland and University of Turku, Department of Mathematics Turku Finland Mathematics Department, University of Turku, Turku, Finland Mathematics Department, University of Turku Turku Finland Department of Computer Science, The University of Western Ontario, London, Ontario, Canada Department of Computer Science, The University of Western Ontario London, Ontario Canada

Corresponding author: Alexandru Mateescu (alexandru_mateescu@fake_email.com).

Academic editor:

1995 28 05 1995 1 5 292 311 A0EBF5E1-6258-52D2-9BA6-F37F5D8EDA6B 6995100 Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu This article is freely available under the J.UCS Open Content License.

Many fuzzy automaton models have been introduced in the past. Here, we discuss two basic finite fuzzy automaton models, the Mealy and Moore types, for lexical analysis. We show that there is a remarkable difference between the two types. We consider that the latter is a suitable model for implementing lexical analysers. Various properties of fuzzy regular languages are reviewed and studied. A fuzzy lexical analyzer generator (FLEX) is proposed. 1.) The work reported here has been supported by the Natural Sciences and Engineering Research Council of Canada grants OGP0041630 and the Project 11281 of the Academy of Finland.