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