Citation:
Honkala J (1999) On Algebraicness of D0L Power Series. JUCS - Journal of Universal Computer Science 5(1): 11-19. https://doi.org/10.3217/jucs-005-01-0011
Abstract
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebraic in case A = Q+ or A = N. The proof relies heavily on the use of elementary morphisms in a power series framework and gives also a new method to decide whether or not a given D0L language is context-free.