dblp.uni-trier.dewww.uni-trier.de

Michael Domaratzki

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
40EEMark Daley, Michael Domaratzki, Kai Salomaa: State complexity of orthogonal catenation CoRR abs/0904.3366: (2009)
2008
39EEMichael Domaratzki: Formal Language Tools for Template-Guided DNA Recombination. LATA 2008: 3-5
38EEMichael Domaratzki: Characterizing DNA Bond Shapes Using Trajectories. Fundam. Inform. 87(3-4): 269-285 (2008)
37EEMichael Domaratzki, Kai Salomaa: Preface. Int. J. Found. Comput. Sci. 19(5): 1085-1086 (2008)
36EEMichael Domaratzki, Kai Salomaa: Lower bounds for the transition complexity of NFAs. J. Comput. Syst. Sci. 74(7): 1116-1130 (2008)
35EEMichael Domaratzki: Equivalence in template-guided recombination. Natural Computing 7(3): 439-449 (2008)
2007
34EEMichael Domaratzki: Equivalence in Template-Guided Recombination. DNA 2007: 263-272
33EEMark Daley, Michael Domaratzki, Alexis Morris: Intra-Molecular Template-Guided Recombination. Int. J. Found. Comput. Sci. 18(6): 1177-1186 (2007)
32 Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit: Enumeration of Context-Free Languages and Related Structures. Journal of Automata, Languages and Combinatorics 12(1-2): 79-95 (2007)
31EEMichael Domaratzki: Bond-free DNA language classes. Natural Computing 6(4): 371-402 (2007)
30EEMark Daley, Michael Domaratzki: On codes defined by bio-operations. Theor. Comput. Sci. 378(1): 3-16 (2007)
29EEMichael Domaratzki, Kai Salomaa: Transition complexity of language operations. Theor. Comput. Sci. 387(2): 147-154 (2007)
2006
28EEMichael Domaratzki: Hairpin Structures Defined by DNA Trajectories. DNA 2006: 182-194
27EEMichael Domaratzki: Characterizing DNA Bond Shapes Using Trajectories. Developments in Language Theory 2006: 180-191
26EEMichael Domaratzki, Kai Salomaa: Lower Bounds for the Transition Complexity of NFAs. MFCS 2006: 315-326
25EEMichael Domaratzki, Grzegorz Rozenberg, Kai Salomaa: Interpreted Trajectories. Fundam. Inform. 73(1-2): 81-97 (2006)
24EEMichael Domaratzki, Kai Salomaa: Codes defined by multiple sets of trajectories. Theor. Comput. Sci. 366(3): 182-193 (2006)
23EEMichael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón: Algebraic properties of substitution on trajectories. Theor. Comput. Sci. 369(1-3): 183-196 (2006)
2005
22 Michael Domaratzki: More Words on Trajectories. Bulletin of the EATCS 86: 107-145 (2005)
21EEMichael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang: Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16(5): 883-896 (2005)
20EEMichael Domaratzki, Kai Salomaa: Restricted sets of trajectories and decidability of shuffle decompositions. Int. J. Found. Comput. Sci. 16(5): 897-912 (2005)
19EEMichael Domaratzki, Kai Salomaa: Decidability of trajectory-based equations. Theor. Comput. Sci. 345(2-3): 304-330 (2005)
2004
18 Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers Springer 2004
17EEMark Daley, Michael Domaratzki: On Codes Defined by Bio-Operations. Developments in Language Theory 2004: 127-138
16EEMichael Domaratzki: Semantic Shuffle on and Deletion Along Trajectories. Developments in Language Theory 2004: 163-174
15EEMichael Domaratzki, Kai Salomaa: Decidability of Trajectory-Based Equations. MFCS 2004: 723-734
14EEMichael Domaratzki: Trajectory-based codes. Acta Inf. 40(6-7): 491-527 (2004)
13EEMichael Domaratzki: Trajectory-Based Embedding Relations. Fundam. Inform. 59(4): 349-363 (2004)
12EEMichael Domaratzki: Improved Bounds On The Number Of Automata Accepting Finite Languages. Int. J. Found. Comput. Sci. 15(1): 143-161 (2004)
11 Michael Domaratzki, Kai Salomaa: State Complexity of Shuffle on Trajectories. Journal of Automata, Languages and Combinatorics 9(2/3): 217-232 (2004)
10EEMichael Domaratzki, Alexander Okhotin: Representing recursively enumerable languages by iterated deletion. Theor. Comput. Sci. 314(3): 451-457 (2004)
9EEMichael Domaratzki: Deletion along trajectories. Theor. Comput. Sci. 320(2-3): 293-313 (2004)
2003
8EEMichael Domaratzki: On Enumeration of Müller Automata. Developments in Language Theory 2003: 254-265
7 Michael Domaratzki: On Iterated Scattered Deletion. Bulletin of the EATCS 80: 159-161 (2003)
2002
6EEMichael Domaratzki: Improved Bounds on the Number of Automata Accepting Finite Languages. Developments in Language Theory 2002: 209-219
5EEAlexander Okhotin, Kai Salomaa, Michael Domaratzki: One-Visit Caterpillar Tree Automata. Fundam. Inform. 52(4): 361-375 (2002)
4EEMichael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit: Simulating finite automata with context-free grammars. Inf. Process. Lett. 84(6): 339-344 (2002)
3 Michael Domaratzki: State Complexity of Proportional Removals. Journal of Automata, Languages and Combinatorics 7(4): 455-468 (2002)
2 Michael Domaratzki, Derek Kisman, Jeffrey Shallit: On the Number of Distinct Languages Accepted by Finite Automata with n States. Journal of Automata, Languages and Combinatorics 7(4): 469-486 (2002)
2001
1EEMichael Domaratzki, Jeffrey Shallit, Sheng Yu: Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329

Coauthor Index

1Mark Daley [17] [30] [33] [40]
2Keith Ellul [21]
3Derek Kisman [2]
4Alexis Morris [33]
5Alexander Okhotin [5] [10] [18] [32]
6Giovanni Pighizzini [4]
7Alfonso Rodríguez-Patón [23]
8Grzegorz Rozenberg [25]
9Kai Salomaa [5] [11] [15] [18] [19] [20] [24] [25] [26] [29] [36] [37] [40]
10Jeffrey Shallit [1] [2] [4] [21] [32]
11Petr Sosík [23]
12Ming-wei Wang [21]
13Sheng Yu [1] [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)