| 2002 | ||
|---|---|---|
| c7 | Jari Töyli, Matti Linna, Merja Wanne: Modeling Relational Data by the Adjacency Model. ICEIS 2002: 296-301 | |
| 1999 | ||
| j7 | ||
| 1987 | ||
| c6 | Karel Culik II, Matti Linna: The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. FSTTCS 1987: 15-25 | |
| 1986 | ||
| j6 | ||
| 1984 | ||
| j5 | Tero Harju, Matti Linna: The Equations h(w)=w-n in Binary Alphabets. Theor. Comput. Sci. 33: 327-329 (1984) | |
| 1981 | ||
| c5 | Matti Linna: On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. FCT 1981: 244-249 | |
| 1979 | ||
| j4 | Matti Linna: Two Decidability Results for Deterministic Pushdown Automata. J. Comput. Syst. Sci. 18(1): 92-107 (1979) | |
| c4 | ||
| 1977 | ||
| j3 | Matti Linna: A Decidability Result for Deterministic omega-Context-Free Languages. Theor. Comput. Sci. 4(1): 83-98 (1977) | |
| c3 | ||
| 1976 | ||
| j2 | Matti Linna: On omega-Sets Associated with Context-Free Languages. Information and Control 31(3): 272-293 (1976) | |
| j1 | Matti Linna: The D0L-ness for Context-Free Languages is Decidable. Inf. Process. Lett. 5(5): 149-151 (1976) | |
| c2 | ||
| 1972 | ||
| c1 | ||
| 1 | Karel Culik II | |
| 2 | Tero Harju | |
| 3 | Martti Penttonen | |
| 4 | Jari Töyli | |
| 5 | Merja Wanne |
Colors in the list of coauthors
Last update Wed May 22 16:12:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page