Juha Honkala
jhonkala@utu.fi +358 29 450 4302 +358 50 300 1017 Vesilinnantie 5 Turku |
- Decidability questions related to abstract numeration systems (2004)
- Discrete Mathematics
- It is decidable whether the image of an N-rational sequence has a base (2004)
- Journal of Number Theory
- On infinite HD0L words having sparse letters (2004)
- International Journal of Computer Mathematics
- A bound for the omega-equivalence problem of polynomial dol systems (2003)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- Decidability results for Watson-Crick D0L systems with nonregular triggers (2003)
- Theoretical Computer Science
- On images of D0L and DT0L power series (2003)
- Theoretical Computer Science
- On the images of N-rational sequences counting multiplicities (2003)
- International Journal of Algebra and Computation
- The equivalence problem of polynomially bounded D0L systems - a bound depending only on the size of the alphabet (2003)
- Theory of Computing Systems
- A new class of algebraic series having a decidable equivalence problem (2002)
- Fundamenta Informaticae
- On infinite words generated by polynomial DOL systems (2002)
- Discrete Applied Mathematics



