JUCS - Journal of Universal Computer Science 1(5): 292-311, doi: 10.3217/jucs-001-05-0292
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model
expand article infoAlexandru Mateescu‡, Arto Salomaa‡, Kai Salomaa§, Sheng Yu|
‡ Academy of Finland and University of Turku, Department of Mathematics, Turku, Finland§ Mathematics Department, University of Turku, Turku, Finland| Department of Computer Science, The University of Western Ontario, London, Ontario, Canada

Corresponding author: Alexandru Mateescu

© Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu.
This article is freely available under the J.UCS Open Content License.
Citation: Mateescu A, Salomaa A, Salomaa K, Yu S (1995) Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. JUCS - Journal of Universal Computer Science 1(5): 292-311. https://doi.org/10.3217/jucs-001-05-0292
Open Access
Abstract
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.