Finite Power Property of Regular Languages. - Matti Linna (ICALP, 1972)

The D0L-ness for Context-Free Languages is Decidable. - Matti Linna (Inf. Process. Lett., 1976)

On omega-Sets Associated with Context-Free Languages - Matti Linna (Inf. Control., 1976)

A Decidability Result for Deterministic omega-Context-Free Languages. - Matti Linna (Theor. Comput. Sci., 1977)

New Proofs for Jump DPDA's. - Matti Linna; Martti Penttonen (MFCS, 1979)

Two Decidability Results for Deterministic Pushdown Automata. - Matti Linna (J. Comput. Syst. Sci., 1979)

On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. - Matti Linna (FCT, 1981)

A note on morphic characterization of languages. - Juhani Karhumäki; Matti Linna (Discret. Appl. Math., 1983)

The Equations h(w)=w-n in Binary Alphabets. - Tero Harju; Matti Linna (Theor. Comput. Sci., 1984)

On the Periodicity of Morphisms on Free Monoids. - Tero Harju; Matti Linna (RAIRO Theor. Informatics Appl., 1986)

The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. - Karel Culík II; Matti Linna (FSTTCS, 1987)

A General Model for Adjacency. - Merja Wanne; Matti Linna (Fundam. Informaticae, 1999)

Modeling Relational Data by the Adjacency Model. - Jari Töyli; Matti Linna; Merja Wanne (ICEIS, 2002)