Preface |
| |
| Authors: | AHG Rinnooy Kan |
| |
| Institution: | Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, USA;Institute of Applied Mathematics and Computer Science, University of Leiden, 2300 RA Leiden, The Netherlands;Institute of Mathematics, Tampere University of Technology, SF-33101 Tampere 10, Finland |
| |
| Abstract: | The following morphic characterization of EOL languages is established. The family of EOL languages equals the family of all languages of the form h(L∩R) where h is a morphism, R is a regular language and L is the maximal solution of an equation , where ? is a morphism, g is a coding and X is a language variable. It is shown that if g is allowed to be a weak coding, then a larger family of languages is obtained, which however is strictly contained in the family of ETOL languages. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
