The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lila Kari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lila Kari
    From Micro-Soft to Bio-Soft: Computing With DNA. [Citation Graph (0, 0)][DBLP]
    BCEC, 1997, pp:146-164 [Conf]
  2. Lila Kari
    Power of Controlled Insertion and Deletion. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:197-212 [Conf]
  3. Lila Kari, Jarkko Kari, Laura F. Landweber
    Reversible Molecular Computation in Ciliates. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:353-363 [Conf]
  4. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Substitution on Trajectories. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:145-158 [Conf]
  5. Lila Kari, Rob Kitto, Gabriel Thierrin
    Codes, Involutions, and DNA Encodings. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:376-393 [Conf]
  6. Lila Kari, Carlos Martín-Vide, Andrei Paun
    On the Universality of P Systems with Minimal Symport/Antiport Rules. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:254-265 [Conf]
  7. Lila Kari, Andrei Paun
    String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:275-287 [Conf]
  8. Mark Daley, Lila Kari
    Some Properties of Ciliate Bio-operations. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:116-127 [Conf]
  9. Natasa Jonoska, Lila Kari, Kalpana Mahalingam
    Involution Solid and Join Codes. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:192-202 [Conf]
  10. Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin
    On Hairpin-Free Words and Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:296-307 [Conf]
  11. Lila Kari, Gabriel Thierrin
    Morphisms and Associated Congruences. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:119-128 [Conf]
  12. Salah Hussini, Lila Kari, Stavros Konstantinidis
    Coding Properties of DNA Languages. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:57-69 [Conf]
  13. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Bond-Free Languages: Formalizations, Maximality and Construction Methods. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:169-181 [Conf]
  14. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Preventing Undesirable Bonds Between DNA Codewords. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:182-191 [Conf]
  15. Lila Kari, Kalpana Mahalingam
    DNA Codes and Their Properties. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:127-142 [Conf]
  16. Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin
    Hairpin Structures in DNA Words. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:158-170 [Conf]
  17. Halina Kaminski, Lila Kari, Mark Perry
    Who Counts Your Votes? [Citation Graph (0, 0)][DBLP]
    EEE, 2005, pp:598-603 [Conf]
  18. Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
    On the Decidability of Self-Assembly of Infinite Ribbons. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:530-537 [Conf]
  19. Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber
    How to Compute with DNA. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:269-282 [Conf]
  20. Lila Kari, Hanan Lutfiyya, Carlos Martín-Vide, Gheorghe Paun
    Bringing PC Grammar Systems Closer to Hoare's CSPs. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:64-85 [Conf]
  21. Lila Kari, Greg Gloor, Sheng Yu
    Using DNA to solve the Bounded Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:51-65 [Conf]
  22. Juraj Hromkovic, Jarkko Kari, Lila Kari
    Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:495-505 [Conf]
  23. Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
    Two Lower Bounds on Distributive Generation of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:423-432 [Conf]
  24. Lila Kari
    Insertion and Deletion of Words: Determinism and Reversibility. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:315-326 [Conf]
  25. Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney
    Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. [Citation Graph (0, 0)][DBLP]
    SPIRE/CRIWG, 1999, pp:47-54 [Conf]
  26. Przemyslaw Prusinkiewicz, Lila Kari
    Subapical Bracketed L-Systems. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:550-564 [Conf]
  27. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Substitutions, Trajectories and Noisy Channels. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:202-212 [Conf]
  28. Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak
    Sticky-free and overhang-free DNA languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:40, n:2, pp:119-157 [Journal]
  29. Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu
    DNA Computing, Sticker Systems, and Universality. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:5, pp:401-420 [Journal]
  30. Lila Kari, Grzegorz Rozenberg, Arto Salomaa
    Generalised DOL Trees. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1995, v:12, n:1, pp:1-10 [Journal]
  31. Erzsébet Csuhaj-Varjú, Lila Kari, Gheorghe Paun
    Test Tube Distributed Systems Based on Splicing. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:2-3, pp:- [Journal]
  32. Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun
    Gramars with Oracles. [Citation Graph (0, 0)][DBLP]
    Sci. Ann. Cuza Univ., 1993, v:2, n:, pp:3-12 [Journal]
  33. Lila Kari
    Insertion operations: Closure properties. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:181-191 [Journal]
  34. Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa
    In the prehistory of formal language theory: Gauss Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:46, n:, pp:124-139 [Journal]
  35. Lila Kari, Petr Sosík
    On Language Equations with Deletion. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:83, n:, pp:173-180 [Journal]
  36. Cezar Câmpeanu, Lila Kari, Andrei Paun
    Results on Transforming NFA into DFCA. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:53-63 [Journal]
  37. Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
    Two Lower Bounds on Distributive Generation of Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:271-284 [Journal]
  38. Lila Kari
    Generalized Derivatives. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:18, n:, pp:27-39 [Journal]
  39. Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun
    Deletion Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:3/4, pp:355-370 [Journal]
  40. Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin
    A Formal Language Analysis of DNA Hairpin Structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:4, pp:453-475 [Journal]
  41. Lila Kari, Elena Losseva
    Block Substitutions and Their Properties. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:165-178 [Journal]
  42. Lila Kari, Gabriel Thierrin
    Contextual Insertions/Deletions and Computability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:1, pp:47-61 [Journal]
  43. Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu
    Towards a DNA Solution to the Shortest Common Superstring Problem. [Citation Graph (0, 0)][DBLP]
    International Journal on Artificial Intelligence Tools, 1999, v:8, n:4, pp:385-400 [Journal]
  44. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Operations on trajectories with applications to coding and bioinformatics. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:531-546 [Journal]
  45. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Bond-free languages: formalizations, maximality and construction methods. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:1039-1070 [Journal]
  46. Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa
    On Parallel Deletions Applied to a Word. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:2, pp:129-144 [Journal]
  47. Lila Kari, Gabriel Thierrin
    Omega-Syntactic Congruences. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:1, pp:13-26 [Journal]
  48. Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano
    The ld and dlad Bio-Operations on Formal Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:3, pp:477-498 [Journal]
  49. Lila Kari, Stavros Konstantinidis
    Language equations, maximality and error-detection. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:1, pp:157-178 [Journal]
  50. Lila Kari, Gabriel Thierrin
    Maximal and Minimal Solutions to Language Equations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:487-496 [Journal]
  51. Lila Kari, Gheorghe Paun, Arto Salomaa
    The Power of Restricted Splicing with Rules from a Regular Language. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:4, pp:224-240 [Journal]
  52. Rudolf Freund, Lila Kari, Gheorghe Paun
    DNA Computing Based on Splicing: The Existence of Universal Computers. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:1, pp:69-112 [Journal]
  53. Lila Kari, Rob Kitto, Greg Gloor
    A computer scientist's guide to molecular biology. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2001, v:5, n:2, pp:95-101 [Journal]
  54. Mark Daley, Oscar H. Ibarra, Lila Kari
    Closure and decidability properties of some language classes with respect to ciliate bio-operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:19-38 [Journal]
  55. Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík
    Computationally universal P systems without priorities: two catalysts are sufficient. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:251-266 [Journal]
  56. Juraj Hromkovic, Jarkko Kari, Lila Kari
    Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:123-147 [Journal]
  57. Salah Hussini, Lila Kari, Stavros Konstantinidis
    Coding properties of DNA languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1557-1579 [Journal]
  58. Masami Ito, Lila Kari, Gabriel Thierrin
    Shuffle and scattered deletion closure of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:1, pp:115-133 [Journal]
  59. Masami Ito, Lila Kari, Gabriel Thierrin
    Insertion and Deletion Closure of Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:1, pp:3-19 [Journal]
  60. Lila Kari
    On Language Equations with Invertible Operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:129-150 [Journal]
  61. Lila Kari, Greg Gloor, Sheng Yu
    Using DNA to solve the Bounded Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:193-203 [Journal]
  62. Lila Kari, Stavros Konstantinidis, Petr Sosík
    On properties of bond-free DNA languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:334, n:1-3, pp:131-159 [Journal]
  63. Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa
    Multi-Pattern Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:253-268 [Journal]
  64. Lila Kari, Petr Sosík
    Aspects of shuffle and deletion on trajectories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:47-61 [Journal]
  65. Lila Kari
    Nanocomputing by Self-assembly. [Citation Graph (0, 0)][DBLP]
    UC, 2007, pp:27- [Conf]
  66. Lila Kari, Kalpana Mahalingam, Gabriel Thierrin
    The syntactic monoid of hairpin-free languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:3-4, pp:153-166 [Journal]
  67. Lila Kari
    DNA computing in vitro and in vivo. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2001, v:17, n:7, pp:823-834 [Journal]

  68. Duplication in DNA Sequences. [Citation Graph (, )][DBLP]


  69. An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words. [Citation Graph (, )][DBLP]


  70. Schema for Parallel Insertion and Deletion. [Citation Graph (, )][DBLP]


  71. DNA Computing and Its Implications for Theoretical Computer Science. [Citation Graph (, )][DBLP]


  72. Pseudo-power Avoidance. [Citation Graph (, )][DBLP]


  73. Watson-Crick Conjugate and Commutative Words. [Citation Graph (, )][DBLP]


  74. On a Special Class of Primitive Words. [Citation Graph (, )][DBLP]


  75. Involution Solid Codes. [Citation Graph (, )][DBLP]


  76. On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. [Citation Graph (, )][DBLP]


  77. The many facets of natural computing. [Citation Graph (, )][DBLP]


  78. Pseudo-Power Avoidance [Citation Graph (, )][DBLP]


  79. Negative Interactions in Irreversible Self-Assembly [Citation Graph (, )][DBLP]


  80. Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings [Citation Graph (, )][DBLP]


  81. Properties of Pseudo-Primitive Words and their Applications [Citation Graph (, )][DBLP]


  82. Triangular Self-Assembly [Citation Graph (, )][DBLP]


  83. Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement [Citation Graph (, )][DBLP]


  84. The Power of Nondeterminism in Self-Assembly [Citation Graph (, )][DBLP]


  85. State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation [Citation Graph (, )][DBLP]


  86. State Complexity of Catenation Combined with Star and Reversal [Citation Graph (, )][DBLP]


  87. Ciliate Gene Unscrambling with Fewer Templates [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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