On D0L systems with finite axiom sets

  • Juha Honkala

Abstract

We give a new solution for the language equivalence problem of D0L systems with finite axiom sets by using the decidability of the equivalence problem of finite valued transducers on HDT0L languages proved by Culik II and Karhumäki.

Downloads

Download data is not yet available.
Published
2003-01-01
How to Cite
Honkala, J. (2003). On D0L systems with finite axiom sets. Acta Cybernetica, 16(1), 29-35. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3607
Issue
Vol 16 No 1 (2003)
Section
Regular articles