[Lecture Notes in Computer Science] Implementation of Functional Languages Volume 1868 ||Koopman, Pieter; Clack, Chris · 2000

[Lecture Notes in Computer Science] Implementation of Functional Languages Volume 1595 ||Hammond, Kevin; Davie, Tony; Clack, Chris · 1999

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 5642 ||Maneth, Sebastian · 2009

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 9223 ||Drewes, Frank · 2015

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1980 Volume 88 || Abstract implementation of abstract data typesDembiński, P. · 1980

[Lecture Notes in Computer Science] Compiling Natural Semantics Volume 1549 || 5 Implementation OverviewPettersson, Mikael · 1999

[Lecture Notes in Computer Science] Instantiation Theory Volume 518 || Implementation and computational complexity, · 1991

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 10329 ||Carayol, Arnaud; Nicaud, Cyril · 2017

Transition complexity of language operationsMichael Domaratzki; Kai Salomaa · 2007

Decidability of trajectory-based equationsMichael Domaratzki; Kai Salomaa · 2005

PREFACEDOMARATZKI, MICHAEL; SALOMAA, KAI · International Journal of Foundations of Computer Science · 2008

PREFACEDOMARATZKI, MICHAEL; SALOMAA, KAI · International Journal of Foundations of Computer Science · 2011

Codes defined by multiple sets of trajectoriesMichael Domaratzki; Kai Salomaa · 2006

Lower bounds for the transition complexity of NFAsMichael Domaratzki; Kai Salomaa · 2008

RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONSDOMARATZKI, MICHAEL; SALOMAA, KAI · International Journal of Foundations of Computer Science · 2005

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 6482 || Approximating Minimum Reset SequencesDomaratzki, Michael; Salomaa, Kai · 2011