The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Erkki Mäkinen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
    Learning Strongly Deterministic Even Linear Languages from Positive Examples. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:41-54 [Conf]
  2. Erkki Mäkinen, Harri Siirtola
    Reordering the Reorderable Matrix as an Algorithmic Problem. [Citation Graph (0, 0)][DBLP]
    Diagrams, 2000, pp:453-467 [Conf]
  3. Erkki Mäkinen, Tarja Systä
    MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML. [Citation Graph (0, 0)][DBLP]
    ICSE, 2001, pp:15-24 [Conf]
  4. Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa
    How to Draw a Sequence Diagram. [Citation Graph (0, 0)][DBLP]
    SPLST, 2003, pp:91-102 [Conf]
  5. Erkki Mäkinen, Tarja Systä
    Minimally adequate teacher synthesizes statechart diagrams. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:4, pp:235-259 [Journal]
  6. Ferucio Laurentiu Tiplea, Erkki Mäkinen, Corina Apachite
    Synchronized extension systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:6, pp:449-465 [Journal]
  7. Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
    Inferring pure context-free languages from positive data. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2000, v:14, n:3, pp:469-477 [Journal]
  8. Johannes Koskinen, Erkki Mäkinen, Tarja Systä
    Implemeting a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2002, v:15, n:4, pp:547-565 [Journal]
  9. Erkki Mäkinen
    On inferring zero-reversible languages. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2000, v:14, n:3, pp:479-484 [Journal]
  10. Erkki Mäkinen
    On Lexicographic Enumeration of Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1997, v:13, n:1, pp:55-62 [Journal]
  11. Erkki Mäkinen
    On Context-Free and Szilard Languages. [Citation Graph (0, 0)][DBLP]
    BIT, 1984, v:24, n:2, pp:164-170 [Journal]
  12. Erkki Mäkinen
    On Permutative Grammars Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    BIT, 1985, v:25, n:4, pp:604-610 [Journal]
  13. Erkki Mäkinen
    Left Distance Binary Tree Representations. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:2, pp:163-169 [Journal]
  14. Erkki Mäkinen
    On Top-Down Splaying. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:3, pp:330-339 [Journal]
  15. Erkki Mäkinen
    Comment on `A Framework for Modelling Trojans and Computer Virus Infection'. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2001, v:44, n:4, pp:321-323 [Journal]
  16. Erkki Mäkinen
    On Implementing Two Adaptive Data-Compression Schemes. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:3, pp:238-240 [Journal]
  17. Erkki Mäkinen
    A Survey on Binary Tree Codings. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1991, v:34, n:5, pp:438-443 [Journal]
  18. Erkki Mäkinen
    Binary Tree Code Words as Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1998, v:41, n:6, pp:422-424 [Journal]
  19. Jarmo Siltaneva, Erkki Mäkinen
    A Comparison of Random Binary Tree Generators. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:6, pp:653-660 [Journal]
  20. Jyrki Katajainen, Erkki Mäkinen
    A note on the complexity of trie compaction. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:41, n:, pp:212-216 [Journal]
  21. Juha Lehikoinen, Erkki Mäkinen
    A New Distance-based Coding Method For Binary Trees. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:55, n:, pp:- [Journal]
  22. Erkki Mäkinen
    A Conjecture on the Error Bound of the Barycenter Heuristic. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:70, n:, pp:156-158 [Journal]
  23. Erkki Mäkinen
    Normal forms for pure context-free grammars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:31, n:, pp:35-37 [Journal]
  24. Erkki Mäkinen
    A note on Graftings, Rotations, and Distances in Binary Trees. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:46, n:, pp:146-148 [Journal]
  25. Erkki Mäkinen
    On Certain Properties of Left Szilard Languages. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:10/11, pp:497-501 [Journal]
  26. Erkki Mäkinen
    On Szilard Languages of Pure Context-free Grammars. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:10/11, pp:527-532 [Journal]
  27. Erkki Mäkinen
    On Breadth-first Context-free Grammars. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1990, v:26, n:3, pp:129-135 [Journal]
  28. Erkki Mäkinen
    A hierarchy of context-free derivations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:14, n:2, pp:255-259 [Journal]
  29. Erkki Mäkinen
    On pure context-free language and left szilard languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:1, pp:86-89 [Journal]
  30. Erkki Mäkinen
    On the generative capacity of context-free matrix grammars over one-letter alphabet. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:16, n:1, pp:93-97 [Journal]
  31. Erkki Mäkinen
    On Grammatical inference and derivational complexity of context grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:4, pp:363-368 [Journal]
  32. Erkki Mäkinen
    A Note on the Grammatical Inference Problem for Even Linear Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:2, pp:175-181 [Journal]
  33. Erkki Mäkinen
    (0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:27, n:4, pp:413-415 [Journal]
  34. Erkki Mäkinen, Ferucio Laurentiu Tiplea
    Pattern Ambiguities for Pure Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:2, pp:183-191 [Journal]
  35. Ferucio Laurentiu Tiplea, Erkki Mäkinen
    A Note on SE-Systems and Regular Canonical Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:46, n:3, pp:253-256 [Journal]
  36. Ferucio Laurentiu Tiplea, Erkki Mäkinen
    Jumping Petri Nets. Specific Properties. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:3-4, pp:373-392 [Journal]
  37. Ferucio Laurentiu Tiplea, Erkki Mäkinen, Dragos Trinca, Costel Enea
    Characterization Results for Time-Varying Codes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:53, n:2, pp:185-198 [Journal]
  38. Hongmei He, Ondrej Sýkora, Erkki Mäkinen
    Genetic algorithms for the 2-page book drawing problem of graphs. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:1, pp:77-93 [Journal]
  39. Ferucio Laurentiu Tiplea, Erkki Mäkinen, Constantin Enea
    SE-Systems, Timing Mechanisms, and Time-Varying Codes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:10, pp:1083-1091 [Journal]
  40. Jyrki Katajainen, Erkki Mäkinen
    Tree Compression and Optimization with Applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:4, pp:425-448 [Journal]
  41. Erkki Mäkinen, Tarja Systä
    Engineering Software by Grammatical Inference. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 2003, v:27, n:4, pp:461-467 [Journal]
  42. Erkki Mäkinen, Harri Siirtola
    The Barycenter Heuristic and the Reorderable Matrix. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 2005, v:29, n:3, pp:357-364 [Journal]
  43. Tarja Systä, Kai Koskimies, Erkki Mäkinen
    Automated compression of state machines using UML statechart diagram notation. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2002, v:44, n:10, pp:565-578 [Journal]
  44. Erkki Mäkinen
    On inferring linear single-tree languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:1-3 [Journal]
  45. Erkki Mäkinen
    Boundedness Testing for Unambiguous Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:4, pp:181-183 [Journal]
  46. Erkki Mäkinen
    On Derivation Preservation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:5, pp:225-228 [Journal]
  47. Erkki Mäkinen
    A Note on Undercover Relation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:1, pp:19-21 [Journal]
  48. Erkki Mäkinen
    An Undecidable Problem for Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:3, pp:141-142 [Journal]
  49. Erkki Mäkinen
    A Note on Pure Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:5, pp:271-274 [Journal]
  50. Erkki Mäkinen
    On the Rotation Distance of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:5, pp:271-272 [Journal]
  51. Erkki Mäkinen
    On Linear Search Heuristics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:1, pp:35-36 [Journal]
  52. Erkki Mäkinen
    On the Subtree Isomorphism Problem for Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:271-273 [Journal]
  53. Erkki Mäkinen
    The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:4, pp:203-206 [Journal]
  54. Erkki Mäkinen
    On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:1-5 [Journal]
  55. Erkki Mäkinen
    Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:125-127 [Journal]
  56. Erkki Mäkinen
    Inferring Uniquely Terminating Regular Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:57-60 [Journal]
  57. Ferucio Laurentiu Tiplea, Erkki Mäkinen
    A note on synchronized extension systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:1, pp:7-9 [Journal]
  58. Isto Aho, Erkki Mäkinen, Tarja Systä
    Remarks on the Thickness of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1998, v:108, n:1-4, pp:1-4 [Journal]
  59. Erkki Mäkinen
    Generating Random Binary Trees - A Survey. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:115, n:1-4, pp:123-136 [Journal]
  60. Erkki Mäkinen, Timo Poranen, Petri Vuorenmaa
    A genetic algorithm for determining the thickness of a graph. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:138, n:1-4, pp:155-164 [Journal]
  61. Harri Siirtola, Erkki Mäkinen
    Constructing and reconstructing the reorderable matrix. [Citation Graph (0, 0)][DBLP]
    Information Visualization, 2005, v:4, n:1, pp:32-48 [Journal]
  62. Erkki Mäkinen
    On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:351-357 [Journal]
  63. Ferucio Laurentiu Tiplea, Erkki Mäkinen
    On the Complexity of a Problem on Monadic String Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:599-609 [Journal]
  64. Erkki Mäkinen
    Inferring Finite Transducers. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2003, v:9, n:1, pp:5-8 [Journal]
  65. Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
    Parallelisation of genetic algorithms for the 2-page crossing number problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:2, pp:229-241 [Journal]
  66. Isto Aho, Erkki Mäkinen
    On a parallel machine scheduling problem with precedence constraints. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:5, pp:493-495 [Journal]
  67. Kai Koskimies, Erkki Mäkinen
    Automatic Synthesis of State Machines from Trace Diagrams. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1994, v:24, n:7, pp:643-658 [Journal]
  68. Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
    Learning Deterministic even Linear Languages From Positive Examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:185, n:1, pp:63-79 [Journal]

  69. Three New Algorithms for Regular Language Enumeration. [Citation Graph (, )][DBLP]


  70. Jumping Petri Nets - Specific Properties. [Citation Graph (, )][DBLP]


  71. Using simulated annealing for producing software architectures. [Citation Graph (, )][DBLP]


  72. Genetic Synthesis of Software Architecture. [Citation Graph (, )][DBLP]


  73. Scenario-Based Genetic Synthesis of Software Architecture. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.455secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002