| |
| 2002 | ||
|---|---|---|
| 14 | Jari Töyli, Matti Linna, Merja Wanne: Modeling Relational Data by the Adjacency Model. ICEIS 2002: 296-301 | |
| 1999 | ||
| 13 | Merja Wanne, Matti Linna: A General Model for Adjacency. Fundam. Inform. 38(1-2): 39-50 (1999) | |
| 1987 | ||
| 12 | Karel Culik II, Matti Linna: The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. FSTTCS 1987: 15-25 | |
| 1986 | ||
| 11 | Tero Harju, Matti Linna: On the Periodicity of Morphisms on Free Monoids. ITA 20(1): 47-54 (1986) | |
| 1984 | ||
| 10 | Tero Harju, Matti Linna: The Equations h(w)=w-n in Binary Alphabets. Theor. Comput. Sci. 33: 327-329 (1984) | |
| 1981 | ||
| 9 | Matti Linna: On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. FCT 1981: 244-249 | |
| 1979 | ||
| 8 | Matti Linna, Martti Penttonen: New Proofs for Jump DPDA's. MFCS 1979: 354-362 | |
| 7 | Matti Linna: Two Decidability Results for Deterministic Pushdown Automata. J. Comput. Syst. Sci. 18(1): 92-107 (1979) | |
| 1977 | ||
| 6 | Matti Linna: Two Decidability Results for Deterministic Pushdown Automata. MFCS 1977: 365-373 | |
| 5 | Matti Linna: A Decidability Result for Deterministic omega-Context-Free Languages. Theor. Comput. Sci. 4(1): 83-98 (1977) | |
| 1976 | ||
| 4 | Matti Linna: On omega-sets Associated with Context-Free Languages. ICALP 1976: 1-19 | |
| 3 | Matti Linna: The D0L-ness for Context-Free Languages is Decidable. Inf. Process. Lett. 5(5): 149-151 (1976) | |
| 2 | Matti Linna: On omega-Sets Associated with Context-Free Languages Information and Control 31(3): 272-293 (1976) | |
| 1972 | ||
| 1 | Matti Linna: Finite Power Property of Regular Languages. ICALP 1972: 87-98 | |
| 1 | Karel Culik II | [12] |
| 2 | Tero Harju | [10] [11] |
| 3 | Martti Penttonen | [8] |
| 4 | Jari Töyli | [14] |
| 5 | Merja Wanne | [13] [14] |