Erkki Mäkinen

According to our database1, Erkki Mäkinen authored at least 107 papers between 1983 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




On Derivation Languages of a Class of Splicing Systems.
Acta Cybern., 2018

Terrain synthesis using noise by examples.
Proceedings of the 21st International Academic Mindtrek Conference, AcademicMindtrek 2017, Tampere, Finland, September 20, 2017

A review on objective measurement of usage in technology acceptance studies.
Univers. Access Inf. Soc., 2016

A Note on the Emptiness of Intersection Problem for Left Szilard Languages.
Acta Cybern., 2016

Task-oriented distributed data fusion in autonomous wireless sensor networks.
Soft Comput., 2015

Techniques for Genetic Software Architecture Design.
Comput. J., 2015

Various heuristic algorithms to minimise the two-page crossingnumbers of graphs.
Open Comput. Sci., 2015

On accepting smart environments at user and societal levels.
Univers. Access Inf. Soc., 2014

On some derivation mechanisms and the complexity of their Szilard languages.
Theor. Comput. Sci., 2014

Educational Data Mining and Problem-Based Learning.
Informatics in Education, 2014

The Complexity of Szilard Languages of Matrix Grammars Revisited.
Fundam. Inform., 2013

Simulated Annealing for Aiding Genetic Algorithm in Software Architecture Synthesis.
Acta Cybern., 2013

Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

On the Complexity of Szilard Languages of Matrix Grammars.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Generating software architecture spectrum with multi-objective genetic algorithms.
Proceedings of the Third World Congress on Nature & Biologically Inspired Computing, 2011

On the Complexity of Szilard Languages of Regulated Grammars.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Multi-objective genetic synthesis of software architecture.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Synthesizing Architecture from Requirements: A Genetic Approach.
Proceedings of the Relating Software Requirements and Architectures., 2011

One- and two-page crossing numbers for some types of graphs.
Int. J. Comput. Math., 2010

Complementary crossover for genetic software architecture synthesis.
Proceedings of the 10th International Conference on Intelligent Systems Design and Applications, 2010

A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks.
IEEE Trans. Neural Networks, 2009

Classes of Szilard Languages in NC1.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

Empirical Study on the Effect of Crossover in Genetic Software Architecture Synthesis.
Proceedings of the World Congress on Nature & Biologically Inspired Computing, 2009

Scenario-Based Genetic Synthesis of Software Architecture.
Proceedings of the Fourth International Conference on Software Engineering Advances, 2009

Using simulated annealing for producing software architectures.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Three New Algorithms for Regular Language Enumeration.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Pattern-Based Genetic Model Refinements in MDA.
Nord. J. Comput., 2008

Genetic Synthesis of Software Architecture.
Proceedings of the Simulated Evolution and Learning, 7th International Conference, 2008

Parallelisation of genetic algorithms for the 2-page crossing number problem.
J. Parallel Distributed Comput., 2007

Genetic algorithms for the 2-page book drawing problem of graphs.
J. Heuristics, 2007

On a parallel machine scheduling problem with precedence constraints.
J. Sched., 2006

Constructing and reconstructing the reorderable matrix.
Information Visualization, 2005

The Barycenter Heuristic and the Reorderable Matrix.
Informatica (Slovenia), 2005

Inferring Finite Transducers.
J. Braz. Comput. Soc., 2003

Engineering Software by Grammatical Inference.
Informatica (Slovenia), 2003

How to Draw a Sequence Diagram.
Proceedings of the Eighth Symposium on Programming Languages and Software Tools, 2003

On the Complexity of a Problem on Monadic String Rewriting Systems.
J. Autom. Lang. Comb., 2002

Automated compression of state machines using UML statechart diagram notation.
Inf. Softw. Technol., 2002

SE-Systems, Timing Mechanisms, and Time-Varying Codes.
Int. J. Comput. Math., 2002

Characterization Results for Time-Varying Codes.
Fundam. Inform., 2002

A Comparison of Random Binary Tree Generators.
Comput. J., 2002

Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams.
Acta Cybern., 2002

Minimally adequate teacher synthesizes statechart diagrams.
Acta Informatica, 2002

On the Inclusion Problem for Very Simple Deterministic Pushdown Automata.
J. Autom. Lang. Comb., 2001

A genetic algorithm for determining the thickness of a graph.
Inf. Sci., 2001

A note on synchronized extension systems.
Inf. Process. Lett., 2001

On the longest upsequence problem for permutations.
Int. J. Comput. Math., 2001

A Note on SE-Systems and Regular Canonical Systems.
Fundam. Inform., 2001

Comment on 'A Framework for Modelling Trojans and Computer Virus Infection'.
Comput. J., 2001

Synchronized extension systems.
Acta Informatica, 2001

MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML.
Proceedings of the 23rd International Conference on Software Engineering, 2001

A note on the expected distribution of degrees in random binary trees.
ACM SIGCSE Bull., 2000

Restricted universe data structures.
ACM SIGCSE Bull., 2000

On inferring linear single-tree languages.
Inf. Process. Lett., 2000

Constructing a binary tree efficiently from its traversals.
Int. J. Comput. Math., 2000

A Conjecture on the Error Bound of the Barycenter Heuristic.
Bull. EATCS, 2000

On inferring zero-reversible languages.
Acta Cybern., 2000

Inferring pure context-free languages from positive data.
Acta Cybern., 2000

Reordering the Reorderable Matrix as an Algorithmic Problem.
Proceedings of the Theory and Application of Diagrams, First International Conference, 2000

Generating Random Binary Trees - A Survey.
Inf. Sci., 1999

Inferring regular languages by merging nonterminals.
Int. J. Comput. Math., 1999

Searching neural network structures with L systems and genetic algorithms.
Int. J. Comput. Math., 1999

Remarks on the Thickness of a Graph.
Inf. Sci., 1998

Ranking and unranking left szilard languages.
Int. J. Comput. Math., 1998

Binary Tree Code Words as Context-Free Languages.
Comput. J., 1998

Learning Deterministic even Linear Languages From Positive Examples.
Theor. Comput. Sci., 1997

Inferring Uniquely Terminating Regular Languages from Positive Data.
Inf. Process. Lett., 1997

Jumping Petri Nets. Specific Properties.
Fundam. Inform., 1997

Pattern Ambiguities for Pure Context-Free Grammars.
Fundam. Inform., 1997

On Lexicographic Enumeration of Regular and Context-Free Languages.
Acta Cybern., 1997

A family of languages which is polynomial-time learnable from positive data in pitt's sense.
Int. J. Comput. Math., 1996

(0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars.
Fundam. Inform., 1996

A Note on the Grammatical Inference Problem for Even Linear Languages.
Fundam. Inform., 1996

A New Distance-based Coding Method For Binary Trees.
Bull. EATCS, 1995

Learning Strongly Deterministic Even Linear Languages from Positive Examples.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

Automatic Synthesis of State Machines from Trace Diagrams.
Softw. Pract. Exp., 1994

Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars.
Inf. Process. Lett., 1992

On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars.
Inf. Process. Lett., 1992

On drawing regular bipartite graphs.
Int. J. Comput. Math., 1992

On Grammatical inference and derivational complexity of context grammars.
Fundam. Inform., 1992

On the generative capacity of context-free matrix grammars over one-letter alphabet.
Fundam. Inform., 1992

A note on Graftings, Rotations, and Distances in Binary Trees.
Bull. EATCS, 1992

On pure context-free language and left szilard languages.
Fundam. Inform., 1991

A hierarchy of context-free derivations.
Fundam. Inform., 1991

A Survey on Binary Tree Codings.
Comput. J., 1991

The Grammatical Inference Problem for the Szilard Languages of Linear Grammars.
Inf. Process. Lett., 1990

Tree Compression and Optimization with Applications.
Int. J. Found. Comput. Sci., 1990

Experiments on drawing 2-level hierarchical graphs.
Int. J. Comput. Math., 1990

How to draw a hypergraph.
Int. J. Comput. Math., 1990

On Breadth-first Context-free Grammars.
J. Inf. Process. Cybern., 1990

A note on the complexity of trie compaction.
Bull. EATCS, 1990

On the Subtree Isomorphism Problem for Ordered Trees.
Inf. Process. Lett., 1989

On Implementing Two Adaptive Data-Compression Schemes.
Comput. J., 1989

On Linear Search Heuristics.
Inf. Process. Lett., 1988

On the Rotation Distance of Binary Trees.
Inf. Process. Lett., 1988

Normal forms for pure context-free grammars.
Bull. EATCS, 1987

On Top-Down Splaying.
BIT Comput. Sci. Sect., 1987

Left Distance Binary Tree Representations.
BIT Comput. Sci. Sect., 1987

A Note on Pure Grammars.
Inf. Process. Lett., 1986

On Szilard Languages of Pure Context-free Grammars.
J. Inf. Process. Cybern., 1986

An Undecidable Problem for Context-Free Grammars.
Inf. Process. Lett., 1985

A Note on Undercover Relation.
Inf. Process. Lett., 1985

On Permutative Grammars Generating Context-Free Languages.
BIT Comput. Sci. Sect., 1985

On Derivation Preservation.
Inf. Process. Lett., 1984

On Context-Free and Szilard Languages.
BIT Comput. Sci. Sect., 1984

Boundedness Testing for Unambiguous Context-Free Grammars.
Inf. Process. Lett., 1983

On Certain Properties of Left Szilard Languages.
J. Inf. Process. Cybern., 1983