| |
| 2001 | ||
|---|---|---|
| 11 | Marjo Lipponen, Arto Salomaa: Simple Words in Equality Sets. Current Trends in Theoretical Computer Science 2001: 717-733 | |
| 2000 | ||
| 10 | EE | Marjo Lipponen: Computational Complementarity and Shift Spaces. J. UCS 6(1): 169-177 (2000) |
| 1999 | ||
| 9 | Eija Jurvanen, Marjo Lipponen: Distinguishability, Simulation and Universality of Moore Tree Automata. Fundam. Inform. 38(1-2): 79-91 (1999) | |
| 1998 | ||
| 8 | Cristian S. Calude, Marjo Lipponen: Computational Complementarity and Sofic Shifts. CATS 1998: 277-290 | |
| 1997 | ||
| 7 | EE | Elena Calude, Marjo Lipponen: Minimal Deterministic Incomplete Automata. J. UCS 3(11): 1180-1193 (1997) |
| 1996 | ||
| 6 | Marjo Lipponen, Arto Salomaa: Simple Words in Equality Sets. Bulletin of the EATCS 60: 123-143 (1996) | |
| 5 | EE | Tero Harju, Marjo Lipponen, Alexandru Mateescu: Flatwords and Post Correspondence Problem. Theor. Comput. Sci. 161(1&2): 93-108 (1996) |
| 1995 | ||
| 4 | Marjo Lipponen: On F-Prime Solutions of the Post Correspondence Problem. Developments in Language Theory 1995: 139-147 | |
| 3 | Marjo Lipponen: Post Correspondence Problem: Words Possible as Primitive Solutions. ICALP 1995: 63-74 | |
| 2 | EE | Marjo Lipponen, Gheorghe Paun: Strongly Prime PCP Words. Discrete Applied Mathematics 63(2): 193-197 (1995) |
| 1994 | ||
| 1 | Marjo Lipponen: Primitive Words and Languages Associated to PCP. Bulletin of the EATCS 53: 217-225 (1994) | |
| 1 | Cristian S. Calude (Cristian Calude) | [8] |
| 2 | Elena Calude | [7] |
| 3 | Tero Harju | [5] |
| 4 | Eija Jurvanen | [9] |
| 5 | Alexandru Mateescu | [5] |
| 6 | Gheorghe Paun | [2] |
| 7 | Arto Salomaa | [6] [11] |