Matti Linna

According to our database, Matti Linna authored at least 13 papers between 1972 and 2002.

Collaborative distances:

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

2002

Modeling Relational Data by the Adjacency Model.

Jari Töyli, Matti Linna, Merja Wanne

Proceedings of the ICEIS 2002, 2002

1999

A General Model for Adjacency.

Merja Wanne, Matti Linna

Fundam. Informaticae, 1999

1987

The Equivalence Problem for n-Tape Finite Automata with Simple Cycles.

Karel Culík II, Matti Linna

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986

On the Periodicity of Morphisms on Free Monoids.

Tero Harju, Matti Linna

RAIRO Theor. Informatics Appl., 1986

1984

The Equations h(w)=w-n in Binary Alphabets.

Tero Harju, Matti Linna

Theor. Comput. Sci., 1984

1983

A note on morphic characterization of languages.

Juhani Karhumäki, Matti Linna

Discret. Appl. Math., 1983

1981

On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars.

Matti Linna

Proceedings of the Fundamentals of Computation Theory, 1981

1979

Two Decidability Results for Deterministic Pushdown Automata.

Matti Linna

J. Comput. Syst. Sci., 1979

New Proofs for Jump DPDA's.

Matti Linna, Martti Penttonen

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977

A Decidability Result for Deterministic <i>omega</i>-Context-Free Languages.

Matti Linna

Theor. Comput. Sci., 1977

1976

On omega-Sets Associated with Context-Free Languages

Matti Linna

Inf. Control., July, 1976

The D0L-ness for Context-Free Languages is Decidable.

Matti Linna

Inf. Process. Lett., 1976

1972

Finite Power Property of Regular Languages.

Matti Linna

Proceedings of the Automata, 1972