| 2011 | LATA | Undecidability of the State Complexity of Composed Regular Operations. | Arto Salomaa, Kai Salomaa, Sheng Yu |
| 2008 | LATA | Length Codes, Products of Languages and Primality. | Arto Salomaa, Kai Salomaa, Sheng Yu |
| 2007 | LATA | State Complexity of Basic Operations Combined with Reversal. | Guangwu Liu, Carlos Martn-Vide, Arto Salomaa, Sheng Yu |
| 2002 | COCOON | DNA Complementarity and Paradigms of Computing. | Arto Salomaa |
| 2001 | ICALP | Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. | Tero Harju, Oscar H. Ibarra, Juhani Karhumki, Arto Salomaa |
| 2000 | DLT | Networks of Watson-Crick D0L Systems. | Erzsbet Csuhaj-Varj, Arto Salomaa |
| 1999 | DLT | On the decomposition of finite languages. | Arto Salomaa, Sheng Yu |
| 1999 | FCT | Caesar and DNA. Views on Cryptology. | Arto Salomaa |
| 1999 | ICALP | DNA Computing: New Ideas and Paradigms. | Grzegorz Rozenberg, Arto Salomaa |
| 1998 | MFCS | Shuffle on Trajectories: The Schtzenberger Product and Related Operations. | Tero Harju, Alexandru Mateescu, Arto Salomaa |
| 1997 | FSE | TWOPRIME: A Fast Stream Ciphering Algorithm. | Cunsheng Ding, Valtteri Niemi, Ari Renvall, Arto Salomaa |
| 1997 | ICEC | Computing by splicing: programmed and evolving splicing systems. | Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa |
| 1994 | STACS | Nondeterminism in Patterns. | Alexandru Mateescu, Arto Salomaa |
| 1993 | DLT | Algorithmically Coding the Universe. | Cristian Calude, Arto Salomaa |
| 1993 | DLT | Contextual Grammars: Erasing, Determinism, One-Side Contexts. | Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa |
| 1993 | FCT | Pattern Languages: Problems of Decidability and Generation. | Arto Salomaa |
| 1993 | ICALP | Inclusion is Undecidable for Pattern Languages. | Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu |
| 1993 | MFCS | Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. | Alexandru Mateescu, Arto Salomaa |
| 1991 | ICALP | L Morphisms: Bounded Delay and Regularity of Ambiguity. | Juha Honkala, Arto Salomaa |
| 1983 | ICALP | Ambiguity and Decision Problems Concerning Number Systems. | Karel Culk II, Arto Salomaa |
| 1980 | ICALP | Grammatical Families. | Arto Salomaa |
| 1979 | MFCS | Power from Power Series. | Arto Salomaa |
| 1976 | MFCS | Recent Results on L Systems. | Arto Salomaa |
| 1975 | MFCS | Formal Power Series and Growth Functions of Lindenmayer Systems. | Arto Salomaa |
| 1974 | ICALP | Parallelism in Rewriting Systems. | Arto Salomaa |
| 1973 | MFCS | L-Systems: A Device in Biologically Motivated Automata Theory. | Arto Salomaa |