# Michael Domaratzki

According to our database

Collaborative distances:

^{1}, Michael Domaratzki authored at least 64 papers between 2001 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Somatic Copy Number Alteration-Based Prediction of Molecular Subtypes of Breast Cancer Using Deep Learning Model.

Proceedings of the Advances in Artificial Intelligence, 2017

2014

Metabolic Network Prediction Through Pairwise Rational Kernels.

BMC Bioinformatics, 2014

Pairwise Rational Kernels Obtained by Automaton Operations.

Proceedings of the Implementation and Application of Automata, 2014

Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks.

Proceedings of the Artificial Neural Networks in Pattern Recognition, 2014

2013

Composition and orbits of language operations: finiteness and upper bounds.

Int. J. Comput. Math., 2013

2012

Abelian Primitive Words.

Int. J. Found. Comput. Sci., 2012

2011

Finite Orbits of Language Operations

CoRR, 2011

Finite Orbits of Language Operations.

Proceedings of the Language and Automata Theory and Applications, 2011

Abelian Primitive Words.

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

On Language Decompositions and Primality.

Proceedings of the Rainbow of Computer Science, 2011

2010

Orthogonal Concatenation: Language Equations and State Complexity.

J. UCS, 2010

Abelian Primitive Words

CoRR, 2010

2009

State complexity of power.

Theor. Comput. Sci., 2009

Hairpin Structures Defined by DNA Trajectories.

Theory Comput. Syst., 2009

Minimality in template-guided recombination.

Inf. Comput., 2009

State complexity of orthogonal catenation

CoRR, 2009

Template-Guided Recombination: From Theory to Laboratory.

Proceedings of the Algorithmic Bioprocesses, 2009

2008

Equivalence in template-guided recombination.

Natural Computing, 2008

Lower bounds for the transition complexity of NFAs.

J. Comput. Syst. Sci., 2008

Preface.

Int. J. Found. Comput. Sci., 2008

Characterizing DNA Bond Shapes Using Trajectories.

Fundam. Inform., 2008

Formal Language Tools for Template-Guided DNA Recombination.

Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of Orthogonal Catenation.

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Transition complexity of language operations.

Theor. Comput. Sci., 2007

On codes defined by bio-operations.

Theor. Comput. Sci., 2007

Bond-free DNA language classes.

Natural Computing, 2007

Enumeration of Context-Free Languages and Related Structures.

Journal of Automata, Languages and Combinatorics, 2007

Intra-Molecular Template-Guided Recombination.

Int. J. Found. Comput. Sci., 2007

Equivalence in Template-Guided Recombination.

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

Algebraic properties of substitution on trajectories.

Theor. Comput. Sci., 2006

Codes defined by multiple sets of trajectories.

Theor. Comput. Sci., 2006

Interpreted Trajectories.

Fundam. Inform., 2006

Enumeration of Formal Languages.

Bulletin of the EATCS, 2006

Lower Bounds for the Transition Complexity of NFAs.

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Hairpin Structures Defined by DNA Trajectories.

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

Characterizing DNA Bond Shapes Using Trajectories.

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Transition Complexity of Language Operations.

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Decidability of trajectory-based equations.

Theor. Comput. Sci., 2005

Restricted sets of trajectories and decidability of shuffle decompositions.

Int. J. Found. Comput. Sci., 2005

Non-uniqueness and radius of cyclic unary NFAs.

Int. J. Found. Comput. Sci., 2005

More Words on Trajectories.

Bulletin of the EATCS, 2005

Enumeration of Context-Free Languages and Related Structures.

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

Representing recursively enumerable languages by iterated deletion.

Theor. Comput. Sci., 2004

Deletion along trajectories.

Theor. Comput. Sci., 2004

State Complexity of Shuffle on Trajectories.

Journal of Automata, Languages and Combinatorics, 2004

Improved Bounds On The Number Of Automata Accepting Finite Languages.

Int. J. Found. Comput. Sci., 2004

Trajectory-Based Embedding Relations.

Fundam. Inform., 2004

Trajectory-based codes.

Acta Inf., 2004

Decidability of Trajectory-Based Equations.

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Semantic Shuffle on and Deletion Along Trajectories.

Proceedings of the Developments in Language Theory, 2004

On Codes Defined by Bio-Operations.

Proceedings of the Developments in Language Theory, 2004

Restricted sets of trajectories and decidability of shuffle decompositions.

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Non-Uniqueness and Radius of Cyclic Unary NFAs.

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003

On Iterated Scattered Deletion.

Bulletin of the EATCS, 2003

On Enumeration of Müller Automata.

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

On the Number of Distinct Languages Accepted by Finite Automata with n States.

Journal of Automata, Languages and Combinatorics, 2002

State Complexity of Proportional Removals.

Journal of Automata, Languages and Combinatorics, 2002

Simulating finite automata with context-free grammars.

Inf. Process. Lett., 2002

One-Visit Caterpillar Tree Automata.

Fundam. Inform., 2002

Improved Bounds on the Number of Automata Accepting Finite Languages.

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

State Complexity of Shuffle on Trajectories.

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Minimal Covers of Formal Languages.

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

On the Number of Distinct Languages Accepted by Finite Automata with n States.

Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

State Complexity and Proportional Removals.

Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001