The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matti Linna: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002