Marjo Lipponen

According to our database, Marjo Lipponen authored at least 11 papers between 1994 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

Simple Words in Equality Sets.

Marjo Lipponen, Arto Salomaa

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

Computational Complementarity and Shift Spaces.

Marjo Lipponen

J. Univers. Comput. Sci., 2000

1999

Distinguishability, Simulation and Universality of Moore Tree Automata.

Eija Jurvanen, Marjo Lipponen

Fundam. Informaticae, 1999

1998

Computational Complementarity and Sofic Shifts.

Cristian S. Calude, Marjo Lipponen

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

Minimal Deterministic Incomplete Automata.

Elena Calude, Marjo Lipponen

J. Univers. Comput. Sci., 1997

1996

Flatwords and Post Correspondence Problem.

Tero Harju, Marjo Lipponen, Alexandru Mateescu

Theor. Comput. Sci., 1996

Simple Words in Equality Sets.

Marjo Lipponen, Arto Salomaa

Bull. EATCS, 1996

1995

Strongly Prime PCP Words.

Marjo Lipponen, Gheorghe Paun

Discret. Appl. Math., 1995

Post Correspondence Problem: Words Possible as Primitive Solutions.

Marjo Lipponen

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

On F-Prime Solutions of the Post Correspondence Problem.

Marjo Lipponen

Proceedings of the Developments in Language Theory II, 1995

1994

Primitive Words and Languages Associated to PCP.

Marjo Lipponen

Bull. EATCS, 1994