The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Domaratzki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Daley, Michael Domaratzki
    On Codes Defined by Bio-Operations. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:127-138 [Conf]
  2. Michael Domaratzki
    Improved Bounds on the Number of Automata Accepting Finite Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:209-219 [Conf]
  3. Michael Domaratzki
    On Enumeration of Müller Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:254-265 [Conf]
  4. Michael Domaratzki
    Semantic Shuffle on and Deletion Along Trajectories. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:163-174 [Conf]
  5. Michael Domaratzki
    Characterizing DNA Bond Shapes Using Trajectories. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:180-191 [Conf]
  6. Michael Domaratzki, Jeffrey Shallit, Sheng Yu
    Minimal Covers of Formal Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:319-329 [Conf]
  7. Michael Domaratzki
    Hairpin Structures Defined by DNA Trajectories. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:182-194 [Conf]
  8. Michael Domaratzki, Kai Salomaa
    Decidability of Trajectory-Based Equations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:723-734 [Conf]
  9. Michael Domaratzki, Kai Salomaa
    Lower Bounds for the Transition Complexity of NFAs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:315-326 [Conf]
  10. Michael Domaratzki
    Trajectory-based codes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:40, n:6-7, pp:491-527 [Journal]
  11. Michael Domaratzki
    On Iterated Scattered Deletion. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:159-161 [Journal]
  12. Michael Domaratzki
    More Words on Trajectories. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:107-145 [Journal]
  13. Michael Domaratzki
    Trajectory-Based Embedding Relations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:59, n:4, pp:349-363 [Journal]
  14. Alexander Okhotin, Kai Salomaa, Michael Domaratzki
    One-Visit Caterpillar Tree Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:52, n:4, pp:361-375 [Journal]
  15. Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa
    Interpreted Trajectories. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:81-97 [Journal]
  16. Michael Domaratzki
    Improved Bounds On The Number Of Automata Accepting Finite Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:143-161 [Journal]
  17. Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang
    Non-uniqueness and radius of cyclic unary NFAs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:883-896 [Journal]
  18. Michael Domaratzki, Kai Salomaa
    Restricted sets of trajectories and decidability of shuffle decompositions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:897-912 [Journal]
  19. Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit
    Simulating finite automata with context-free grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:6, pp:339-344 [Journal]
  20. Michael Domaratzki
    State Complexity of Proportional Removals. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:455-468 [Journal]
  21. Michael Domaratzki, Derek Kisman, Jeffrey Shallit
    On the Number of Distinct Languages Accepted by Finite Automata with n States. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:469-486 [Journal]
  22. Michael Domaratzki
    Deletion along trajectories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:293-313 [Journal]
  23. Michael Domaratzki, Alexander Okhotin
    Representing recursively enumerable languages by iterated deletion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:3, pp:451-457 [Journal]
  24. Michael Domaratzki, Kai Salomaa
    Decidability of trajectory-based equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:304-330 [Journal]
  25. Michael Domaratzki, Kai Salomaa
    Codes defined by multiple sets of trajectories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:182-193 [Journal]
  26. Michael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón
    Algebraic properties of substitution on trajectories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:183-196 [Journal]
  27. Mark Daley, Michael Domaratzki
    On codes defined by bio-operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:1, pp:3-16 [Journal]

  28. Equivalence in Template-Guided Recombination. [Citation Graph (, )][DBLP]


  29. Formal Language Tools for Template-Guided DNA Recombination. [Citation Graph (, )][DBLP]


  30. State complexity of orthogonal catenation [Citation Graph (, )][DBLP]


  31. Abelian Primitive Words [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002