On the Simplification of HD0L Power Series

Простая страница элемента
dc.creatorHonkala,Juha
dc.date2002
dc.date.accessioned2024-02-06T12:52:03Z
dc.date.available2024-02-06T12:52:03Z
dc.descriptionNielsen, 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-008-12-1040
dc.identifierhttps://lib.jucs.org/article/27922/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8254
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 8(12): 1040-1046
dc.subjectFormal power series
dc.subjectLindenmayer systems
dc.subjectD0L power series
dc.titleOn the Simplification of HD0L Power Series
dc.typeResearch Article
Файлы
Коллекции