Erkki Mäkinen

Acta Cybern., 2018

2017

Terrain synthesis using noise by examples.

[BibT_eX]

[DOI]

Tuomo Hyttinen

Proceedings of the 21st International Academic Mindtrek Conference, AcademicMindtrek 2017, Tampere, Finland, September 20, 2017

2016

A review on objective measurement of usage in technology acceptance studies.

[BibT_eX]

[DOI]

Sari Walldén

Roope Raisamo

Univers. Access Inf. Soc., 2016

A Note on the Emptiness of Intersection Problem for Left Szilard Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2016

2015

Task-oriented distributed data fusion in autonomous wireless sensor networks.

[BibT_eX]

[DOI]

Zhenhuan Zhu

Soft Comput., 2015

Techniques for Genetic Software Architecture Design.

[BibT_eX]

[DOI]

Outi Sievi-Korte

Comput. J., 2015

Various heuristic algorithms to minimise the two-page crossingnumbers of graphs.

[BibT_eX]

[DOI]

Open Comput. Sci., 2015

2014

On accepting smart environments at user and societal levels.

[BibT_eX]

[DOI]

Sari Walldén

Univers. Access Inf. Soc., 2014

On some derivation mechanisms and the complexity of their Szilard languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Educational Data Mining and Problem-Based Learning.

[BibT_eX]

[DOI]

Sari Walldén

Informatics Educ., 2014

2013

The Complexity of Szilard Languages of Matrix Grammars Revisited.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Simulated Annealing for Aiding Genetic Algorithm in Software Architecture Synthesis.

[BibT_eX]

[DOI]

Outi Sievi-Korte

Acta Cybern., 2013

Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2011

On the Complexity of Szilard Languages of Matrix Grammars.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Generating software architecture spectrum with multi-objective genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the Third World Congress on Nature & Biologically Inspired Computing, 2011

On the Complexity of Szilard Languages of Regulated Grammars.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Synthesizing Architecture from Requirements: A Genetic Approach.

[BibT_eX]

[DOI]

Proceedings of the Relating Software Requirements and Architectures., 2011

2010

One- and two-page crossing numbers for some types of graphs.

[BibT_eX]

[DOI]

Ana Salagean

Int. J. Comput. Math., 2010

Complementary crossover for genetic software architecture synthesis.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Intelligent Systems Design and Applications, 2010

2009

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

[BibT_eX]

[DOI]

Zhenhuan Zhu

IEEE Trans. Neural Networks, 2009

Classes of Szilard Languages in NC<sup>1</sup>.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the World Congress on Nature & Biologically Inspired Computing, 2009

Scenario-Based Genetic Synthesis of Software Architecture.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Software Engineering Advances, 2009

Using simulated annealing for producing software architectures.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Three New Algorithms for Regular Language Enumeration.

[BibT_eX]

[DOI]

Margareta Ackerman

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Pattern-Based Genetic Model Refinements in MDA.

[BibT_eX]

Nord. J. Comput., 2008

Genetic Synthesis of Software Architecture.

[BibT_eX]

[DOI]

Proceedings of the Simulated Evolution and Learning, 7th International Conference, 2008

2007

Parallelisation of genetic algorithms for the 2-page crossing number problem.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Genetic algorithms for the 2-page book drawing problem of graphs.

[BibT_eX]

[DOI]

Ondrej Sýkora

J. Heuristics, 2007

2006

On a parallel machine scheduling problem with precedence constraints.

[BibT_eX]

[DOI]

Isto Aho

J. Sched., 2006

2005

Constructing and reconstructing the reorderable matrix.

[BibT_eX]

[DOI]

Harri Siirtola

Inf. Vis., 2005

The Barycenter Heuristic and the Reorderable Matrix.

[BibT_eX]

[DOI]

Harri Siirtola

Informatica (Slovenia), 2005

2003

Inferring Finite Transducers.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2003

Engineering Software by Grammatical Inference.

[BibT_eX]

Informatica (Slovenia), 2003

How to Draw a Sequence Diagram.

[BibT_eX]

Jyrki Nummenmaa

Proceedings of the Eighth Symposium on Programming Languages and Software Tools, 2003

2002

On the Complexity of a Problem on Monadic String Rewriting Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

Automated compression of state machines using UML statechart diagram notation.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2002

SE-Systems, Timing Mechanisms, and Time-Varying Codes.

[BibT_eX]

[DOI]

Constantin Enea

Int. J. Comput. Math., 2002

Characterization Results for Time-Varying Codes.

[BibT_eX]

[DOI]

Dragos Trinca

Costel Enea

Fundam. Informaticae, 2002

A Comparison of Random Binary Tree Generators.

[BibT_eX]

[DOI]

Jarmo Siltaneva

Comput. J., 2002

Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams.

[BibT_eX]

[DOI]

Johannes Koskinen

Acta Cybern., 2002

Minimally adequate teacher synthesizes statechart diagrams.

[BibT_eX]

[DOI]

Acta Informatica, 2002

2001

On the Inclusion Problem for Very Simple Deterministic Pushdown Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

A genetic algorithm for determining the thickness of a graph.

[BibT_eX]

[DOI]

Petri Vuorenmaa

Inf. Sci., 2001

A note on synchronized extension systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

On the longest upsequence problem for permutations.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2001

A Note on SE-Systems and Regular Canonical Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Comment on 'A Framework for Modelling Trojans and Computer Virus Infection'.

[BibT_eX]

[DOI]

Comput. J., 2001

Synchronized extension systems.

[BibT_eX]

[DOI]

Corina Apachite

Acta Informatica, 2001

MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Software Engineering, 2001

2000

A note on the expected distribution of degrees in random binary trees.

[BibT_eX]

[DOI]

Jarmo Siltaneva

ACM SIGCSE Bull., 2000

Restricted universe data structures.

[BibT_eX]

[DOI]

Markku Siermala

ACM SIGCSE Bull., 2000

On inferring linear single-tree languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Constructing a binary tree efficiently from its traversals.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2000

A Conjecture on the Error Bound of the Barycenter Heuristic.

[BibT_eX]

Bull. EATCS, 2000

On inferring zero-reversible languages.

[BibT_eX]

[DOI]

Acta Cybern., 2000

Inferring pure context-free languages from positive data.

[BibT_eX]

[DOI]

Takeshi Koshiba

Yuji Takada

Acta Cybern., 2000

Reordering the Reorderable Matrix as an Algorithmic Problem.

[BibT_eX]

[DOI]

Harri Siirtola

Proceedings of the Theory and Application of Diagrams, First International Conference, 2000

1999

Generating Random Binary Trees - A Survey.

[BibT_eX]

[DOI]

Inf. Sci., 1999

Inferring regular languages by merging nonterminals.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

Searching neural network structures with L systems and genetic algorithms.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

1998

Remarks on the Thickness of a Graph.

[BibT_eX]

[DOI]

Isto Aho

Inf. Sci., 1998

Ranking and unranking left szilard languages.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1998

Binary Tree Code Words as Context-Free Languages.

[BibT_eX]

[DOI]

Comput. J., 1998

1997

Learning Deterministic even Linear Languages From Positive Examples.

[BibT_eX]

[DOI]

Takeshi Koshiba

Yuji Takada

Theor. Comput. Sci., 1997

Inferring Uniquely Terminating Regular Languages from Positive Data.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Jumping Petri Nets. Specific Properties.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Pattern Ambiguities for Pure Context-Free Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

On Lexicographic Enumeration of Regular and Context-Free Languages.

[BibT_eX]

[DOI]

Acta Cybern., 1997

1996

Programming projects on chess.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1996

A family of languages which is polynomial-time learnable from positive data in pitt's sense.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1996

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

A Note on the Grammatical Inference Problem for Even Linear Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

1995

A programming project: trimming the spring algorithm for drawing hypergraphs.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1995

A New Distance-based Coding Method For Binary Trees.

[BibT_eX]

Juha Lehikoinen

Bull. EATCS, 1995

Learning Strongly Deterministic Even Linear Languages from Positive Examples.

[BibT_eX]

[DOI]

Takeshi Koshiba

Yuji Takada

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Automatic Synthesis of State Machines from Trace Diagrams.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1994

1992

Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

On drawing regular bipartite graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1992

On Grammatical inference and derivational complexity of context grammars.

[BibT_eX]

Fundam. Informaticae, 1992

On the generative capacity of context-free matrix grammars over one-letter alphabet.

[BibT_eX]

Fundam. Informaticae, 1992

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

[BibT_eX]

Bull. EATCS, 1992

1991

On pure context-free language and left szilard languages.

[BibT_eX]

Fundam. Informaticae, 1991

A hierarchy of context-free derivations.

[BibT_eX]

Fundam. Informaticae, 1991

A Survey on Binary Tree Codings.

[BibT_eX]

[DOI]

Comput. J., 1991

1990

The Grammatical Inference Problem for the Szilard Languages of Linear Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Tree Compression and Optimization with Applications.

[BibT_eX]

[DOI]

Jyrki Katajainen

Int. J. Found. Comput. Sci., 1990

Experiments on drawing 2-level hierarchical graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

How to draw a hypergraph.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

On Breadth-first Context-free Grammars.

[BibT_eX]

J. Inf. Process. Cybern., 1990

A note on the complexity of trie compaction.

[BibT_eX]

Jyrki Katajainen

Bull. EATCS, 1990

1989

On the Subtree Isomorphism Problem for Ordered Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

On Implementing Two Adaptive Data-Compression Schemes.

[BibT_eX]

[DOI]

Comput. J., 1989

1988

On Linear Search Heuristics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

On the Rotation Distance of Binary Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1987

Normal forms for pure context-free grammars.

[BibT_eX]

Bull. EATCS, 1987

On Top-Down Splaying.

[BibT_eX]

[DOI]

BIT, 1987

Left Distance Binary Tree Representations.

[BibT_eX]

[DOI]

BIT, 1987

1986

A Note on Pure Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

On Szilard Languages of Pure Context-free Grammars.

[BibT_eX]

J. Inf. Process. Cybern., 1986

1985

An Undecidable Problem for Context-Free Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

A Note on Undercover Relation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

On Permutative Grammars Generating Context-Free Languages.

[BibT_eX]

[DOI]

BIT, 1985

1984

On Derivation Preservation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

On Context-Free and Szilard Languages.

[BibT_eX]

[DOI]

BIT, 1984

1983

Boundedness Testing for Unambiguous Context-Free Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

On Certain Properties of Left Szilard Languages.

[BibT_eX]