Juha Honkala
jhonkala@utu.fi +358 29 450 4302 +358 50 300 1017 Vesilinnantie 5 Turku |
2 of 5
- Marked D0L systems and the 2n-conjecture (2012)
- Theoretical Computer Science
- Ultimately periodic languages (2012)
- Journal of Automata, Languages and Combinatorics
- A characterization of rational D0L power series (2011)
- Acta Informatica
- THE CYCLICITY PROBLEM FOR THE IMAGES OF Q-RATIONAL SERIES (2011)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- The Sequence Equivalence Problem for Marked DT0L Systems (2011)
- Fundamenta Informaticae
- The equality problem for purely substitutive words (2010) Combinatorics, Automata and Number Theory Honkala Juha
- NUMBER SYSTEMS AND THE INJECTIVITY PROBLEM FOR MATRIX REPRESENTATIONS OF FREE MONOIDS (2009)
- International Journal of Algebra and Computation
- The equality problem for infinite words generated by primitive morphisms (2009)
- Information and Computation
- Cancellation and periodicity properties of iterated morphisms (2008)
- Theoretical Computer Science
- Sparse and slender subsets of monoids (2008)
- Semigroup Forum
- A new bound for the DOL sequence equivalence problem (2007)
- Acta Informatica
- A periodicity property of iterated morphisms (2007)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- The DOL omega-equivalence problem (2007)
- International Journal of Foundations of Computer Science
- On the problem whether the image of an N-rational series equals N (2006)
- Fundamenta Informaticae
- The base problem for DOL Parikh sets (2006)
- International Journal of Foundations of Computer Science
- An n(2)-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet (2005) Honkala J
- The class of HDTOL sequences is closed with respect to rational functions (2005)
- Information Processing Letters
- The equivalence problem for languages defined by transductions on D0L languages (2005)
- International Journal of Computer Mathematics
- The language equivalence problem for HDOL systems having DOL growths (2005)
- Theoretical Computer Science
- Bounds for the D0L language equivalence problem (2004)
- Information and Computation
UTU Research Portal