Searching for authors named "Michael Domaratzki" – sorted by Relevance.
-
Equivalence in Template-Guided Recombination ∗
- Equivalence in Template-Guided Recombination ∗ Michael Domaratzki Department of Computer Science
- Add To MetaCart
-
On the Decidability of 2-Infix-Outfix Codes
- On the Decidability of 2-Infix-Outfix Codes School of Computing Technical Report 2004-479 Michael
- Cited by 2 (1 self) – Add To MetaCart
-
Hairpin structures defined by DNA trajectories
- Hairpin Structures Defined by DNA Trajectories TR–2006–001, FEBRUARY 2006 Michael Domaratzki
- Cited by 1 (0 self) – Add To MetaCart
-
Combinatorial interpretations of a generalization of the Genocchi numbers
- Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
- Cited by 6 (1 self) – Add To MetaCart
-
Deletion along Trajectories
- Deletion along Trajectories Technical Report 2003-464 Michael Domaratzki School of Computing
- Cited by 8 (5 self) – Add To MetaCart
-
Decidability of Trajectory-Based Equations
- Decidability of Trajectory-Based Equations Technical Report 2003-472 Michael Domaratzki and Kai
- Cited by 3 (2 self) – Add To MetaCart
-
State complexity of shuffle on trajectories
- State Complexity of Shuffle on Tra jectories Michael Domaratzki and Kai Salomaa School
- Cited by 5 (4 self) – Add To MetaCart
-
Deletion on Trajectories and Commutative Closure
- Deletion on Trajectories and Commutative Closure Michael Domaratzki y Alexandru Mateescu z
- Add To MetaCart
-
Simulating Finite Automata with Context-Free Grammars
- Simulating Finite Automata with Context-Free Grammars Michael Domaratzki a , Giovanni Pighizzini
- Cited by 2 (1 self) – Add To MetaCart
-
On the Number of Distinct Languages Accepted by Finite Automata with n States
- ON THE NUMBER OF DISTINCT LANGUAGES ACCEPTED BY FINITE AUTOMATA WITH n STATES Michael Domaratzki
- Cited by 20 (3 self) – Add To MetaCart

