On the simplification of HD0L power series

: Honkala J

Publisher: SPRINGER-VERLAG

: 2002

: JOURNAL OF UNIVERSAL COMPUTER SCIENCE

: J UNIVERS COMPUT SCI

: 8

: 12

: 1040

: 1046

: 7

Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will generalize this result for formal power series. We will also give a new proof of the result of Nielsen, Rozenberg, Salomaa and Skyum.