| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Domaratzki, Kai Salomaa |
Preface.  |
Int. J. Found. Comput. Sci.  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit |
Finite Orbits of Language Operations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit |
Finite Orbits of Language Operations. |
LATA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Narad Rampersad |
Abelian Primitive Words. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
On Language Decompositions and Primality. |
Rainbow of Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa (eds.) |
Implementation and Application of Automata - 15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Daley, Michael Domaratzki, Kai Salomaa |
Orthogonal Concatenation: Language Equations and State Complexity. |
J. UCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Narad Rampersad |
Abelian Primitive Words |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin |
State complexity of power. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Minimality in template-guided recombination. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Daley, Michael Domaratzki, Kai Salomaa |
State complexity of orthogonal catenation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Hairpin Structures Defined by DNA Trajectories. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Hairpins, DNA trajectories, DNA words, Formal languages |
| 1 | Michael Domaratzki |
Equivalence in template-guided recombination. |
Natural Computing |
2008 |
DBLP DOI BibTeX RDF |
Template-guided recombination, DNA recombination, Equivalence, Ciliates |
| 1 | Michael Domaratzki, Kai Salomaa |
Preface. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Characterizing DNA Bond Shapes Using Trajectories. |
Fundam. Inform. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Lower bounds for the transition complexity of NFAs. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Formal Language Tools for Template-Guided DNA Recombination. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Daley, Michael Domaratzki, Kai Salomaa |
State Complexity of Orthogonal Catenation. |
DCFS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Bond-free DNA language classes. |
Natural Computing |
2007 |
DBLP DOI BibTeX RDF |
bond free properties, shuffle on trajectories, theory of codes |
| 1 | Mark Daley, Michael Domaratzki |
On codes defined by bio-operations. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Transition complexity of language operations. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Daley, Michael Domaratzki, Alexis Morris |
Intra-Molecular Template-Guided Recombination. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit |
Enumeration of Context-Free Languages and Related Structures. |
Journal of Automata, Languages and Combinatorics |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Equivalence in Template-Guided Recombination. |
DNA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón |
Algebraic properties of substitution on trajectories. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Codes defined by multiple sets of trajectories. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa |
Interpreted Trajectories. |
Fundam. Inform. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Enumeration of Formal Languages. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Hairpin Structures Defined by DNA Trajectories. |
DNA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Lower Bounds for the Transition Complexity of NFAs. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Characterizing DNA Bond Shapes Using Trajectories. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Transition Complexity of Language Operations. |
DCFS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Decidability of trajectory-based equations. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang |
Non-uniqueness and radius of cyclic unary NFAs. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Restricted sets of trajectories and decidability of shuffle decompositions. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
More Words on Trajectories. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit |
Enumeration of Context-Free Languages and Related Structures. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin |
Representing recursively enumerable languages by iterated deletion. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Deletion along trajectories. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Improved Bounds On The Number Of Automata Accepting Finite Languages. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Trajectory-based codes. |
Acta Inf. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Trajectory-Based Embedding Relations. |
Fundam. Inform. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
State Complexity of Shuffle on Trajectories. |
Journal of Automata, Languages and Combinatorics |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Decidability of Trajectory-Based Equations. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Daley, Michael Domaratzki |
On Codes Defined by Bio-Operations. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki |
Semantic Shuffle on and Deletion Along Trajectories. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
Restricted sets of trajectories and decidability of shuffle decompositions. |
DCFS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang |
Non-Uniqueness and Radius of Cyclic Unary NFAs. |
DCFS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (eds.) |
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers |
CIAA |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
On Iterated Scattered Deletion. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
On Enumeration of Müller Automata. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit |
Simulating finite automata with context-free grammars. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa, Michael Domaratzki |
One-Visit Caterpillar Tree Automata. |
Fundam. Inform. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
State Complexity of Proportional Removals. |
Journal of Automata, Languages and Combinatorics |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
Improved Bounds on the Number of Automata Accepting Finite Languages. |
Developments in Language Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Kai Salomaa |
State Complexity of Shuffle on Trajectories. |
DCFS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Jeffrey Shallit, Sheng Yu |
Minimal Covers of Formal Languages. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Derek Kisman, Jeffrey Shallit |
On the Number of Distinct Languages Accepted by Finite Automata with n States. |
DCFS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki |
State Complexity and Proportional Removals. |
DCFS |
2001 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")