EOL languages are not codings of FPOL languages |
| |
| Authors: | A. Enrenfeucht G. Rozenberg |
| |
| Affiliation: | Department of Computer Science, University of Colorado, Boulder, CO, U.S.A.;Department of Mathematics, University of Antwerp, UIA, 2610 Wilrijk, Belgium |
| |
| Abstract: | One of the useful results concerning EOL languages states that a language is an EOL language if and only if it is a cording of OL language. In this paper we retine this result by demonstrating that there exist EOL languages that are not codings of languages that are generated by propagating OL systems with finite axiom sets. This solves Problem 10 from the L Systems Problem Book '75. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
