The following pages link to Erkki Maekinen (Q594603):
Displaying 50 items.
- (Q172109) (redirect page) (← links)
- An annotated bibliography on the thickness, outerthickness, and arboricity of a graph (Q263943) (← links)
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- On inferring linear single-tree languages (Q294705) (← links)
- Boundedness testing for unambiguous context-free grammars (Q594604) (← links)
- On context-free and Szilard languages (Q794440) (← links)
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874) (← links)
- Remarks on the thickness and outerthickness of a graph (Q814092) (← links)
- Parallelisation of genetic algorithms for the 2-page crossing number problem (Q866771) (← links)
- On a parallel machine scheduling problem with precedence constraints (Q880562) (← links)
- The grammatical inference problem for the Szilard languages of linear grammars (Q917317) (← links)
- Finding the permutations corresponding to a given Young tableau (Q1001688) (← links)
- On derivation preservation (Q1058859) (← links)
- A note on depth-first derivations (Q1065553) (← links)
- An undecidable problem for context-free grammars (Q1067789) (← links)
- On permutative grammars generating context-free languages (Q1068558) (← links)
- A note on pure grammars (Q1092672) (← links)
- On top-down splaying (Q1101236) (← links)
- On linear search heuristics (Q1114411) (← links)
- On the subtree isomorphism problem for ordered trees (Q1124598) (← links)
- On the structural grammatical inference problem for some classes of context-free grammars (Q1198013) (← links)
- Remarks on the structural grammatical inference problem for context-free grammars (Q1205715) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- Learning deterministic even linear languages from positive examples (Q1390943) (← links)
- A note on Rémy's algorithm for generating random binary trees (Q1407492) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- A note on synchronized extension systems (Q1603428) (← links)
- Minimally adequate teacher synthesizes statechart diagrams (Q1608935) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- Constructing a binary tree from its traversals (Q1822943) (← links)
- A note on undercover relation (Q2265818) (← links)
- On some derivation mechanisms and the complexity of their Szilard languages (Q2453536) (← links)
- A family of languages which is polynomial-time learnable from positive data in pitt's sense (Q2710786) (← links)
- (Q2714262) (← links)
- (Q2714263) (← links)
- (Q2730722) (← links)
- On the longest upsequence problem for permutations (Q2731076) (← links)
- A Survey on Binary Tree Codings (Q2740922) (← links)
- (Q2753908) (← links)
- Comment on 'A Framework for Modelling Trojans and Computer Virus Infection' (Q2765230) (← links)
- A Note on the Emptiness of Intersection Problem for Left Szilard Languages (Q2820784) (← links)
- Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views (Q2843083) (← links)
- REINFORCING THE SPRING ALGORITHMS: THE TAGUCHI APPROACH (Q2968239) (← links)
- (Q3028359) (← links)
- On the Complexity of Szilard Languages of Regulated Grammars (Q3105746) (← links)
- SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES (Q3147310) (← links)
- (Q3200545) (← links)
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS (Q3210891) (← links)
- (Q3325061) (← links)
- How to draw a hypergraph (Q3477978) (← links)
