Published December 28, 2002 | Version v1

On the Simplification of HD0L Power Series

Authors/Creators

  • 1. Department of Mathematics University of Turku and Turku Centre for Computer Science (TUCS), Turku, Finland

Description

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.

Files

jucs_article_27922.pdf

Files (93.9 kB)

Name Size Download all
md5:14a3efc05bb9e071476ddc465c446b7d
93.9 kB Preview Download