1974

• An example of a PD2L-system with the growth type 2 1/2, Inform. Process. Lett. 2:131-134, 1974. (1)
• The family of PDOL growth-sets in properly included in the family of DOL growth-sets, Ann. Acad. Sci. Fenn., A 1, 590, 1974. (1)
• Some growth functions of context-dependent L systems. Springer Lecture Notes in Computer Science 15:125-135, 1974. (2)

1976

• Two theorems concerning recognizable N-subsets of S*, Theoret. Comput. Sci. 1:317-323, 1976. (1)
• On length sets of informationless L systems, in: A. Lindenmayer and G. Rozenberg (eds.). Automata, Languages, Development, North-Holland, 227-242, 1976. (2)
• Studies of informationless L systems. Ann. Univ. Turkuensis ser. A I 171, 1976 (Summary of Ph.D. Thesis). (6)

1977

• The decidability of the equivalence problem for polynomially bounded DOL sequences, RAIRO Theoret. Informatics 11, 17-28, 1977. (1)
• Remarks on commutative N-rational series, Theoret. Comput. Sci. 5, 1977, 211-217. (1)

1978

• A note on DOL length sets, Discrete Mathematics 22, 1978, 233-242 (with A. Ehrenfeucht and G. Rozenberg). (1)

1979

• On commutative DTOL systems, Theoret. Comput. Sci. 9, 207-220, 1979. (1)
• Interactive L systems with almost interactionless behaviour, Information and Control 43, 83-100, 1979 (with K. Culik II); preliminary version in Springer Lecture Notes in Computer Science 74, 246-257, 1979. (1)
• A note on elementary homomorphisms and the regularity of equality sets. Bull. of EATCS 9, 1979 (with I. Simon). (1)

1980

• On the equality sets for homomorphisms on free monoids with two generators. RAIRO Theoret. Informatics 14, 349-369, 1980 (with K. Culik II). (1)
• Generalized Parikh mappings and homomorphisms. Information and Control 47, 155-164, 1980; preliminary version in Springer Lecture Notes in Computer Science 115, 324-332, 1981. (1)

1981

• On strongly cube-free w-words generated by binary morphisms. Springer Lecture Notes in Computer Science 117, 182-189, 1981. (1)
• On the equivalence problem for binary DOL systems. Information and Control 50, 276-284, 1981; preliminary version in Springer Lecture Notes in Computer Science 140, 339-347, 1982. (1)

1982

• The (Generalized) Post correspondence problem with lists consisting of two words is decidable. Theoret. Comput. Sci. 21, 119-140, 1982 (with A. Ehrenfeucht and G. Rozenberg). (1)
• Test sets for context free languages and algebraic systems of equations over a free monoid. Information and Control 52, 172-186, 1982 (with J. Albert and K. Culik). (1)
• Marked morphisms: A tool for solving problems concerning morphisms over a binary alphabet. Proceedings of Second Conference on Foundations of Software Technology and Theoretical Computer Science, Tata Institute of Fundamental Research, Bombay, India, 106-125, 1982. (2)

1983

• Systems of equations over a free monoid and Ehrenfeucht conjecture. Discrete Math. 43, 139-153, 1983 (with Karel Culik II); preliminary version in Springer Lecture Notes in Computer Science 140, 128-140, 1982. (1)
• On cube-free w-words generated by binary morphisms. Discrete Appl. Math. 5, 279-297, 1983. (1)
• On the Ehrenfeucht conjecture for DOL languages. RAIRO Theoret. Inform. 17, 205-230, 1983 (with K. Culik II). (1)
• On binary equality sets and a solution to the test set conjecture in the binary case. Journal of Algebra 85, 76-85, 1983 (with A. Ehrenfeucht and G. Rozenberg). (1)
• A note on morphic characterization of languages. Discrete Appl. Math. 5, 243-246, 1983 (with M. Linna). (1)

1984

• A note on intersections of free submonoids of a free monoid. Semigroup Forum 29, 183-205, 1984; preliminary version in Springer Lecture Notes in Computer Science 154, 397-407, 1983. (1)
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids. Theoret. Comput. Sci. 29, 285-308, 1984. (1)
• On the regularity of equality languages. Ann. Univ. Turkuensis ser A I 186, 1984. (1)
• Inverse morphic equivalence on languages. Inform. Process. Lett. 19 (1984) 213-218 (with D. Wood). (1)