Search the dblp DataBase

Publications of Author

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