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

Lila Kari Vis

Lila Santean

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
89EEBo Cui, Lila Kari, Shinnosuke Seki: On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. CAI 2009: 204-219
88EEElena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki: An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words. Developments in Language Theory 2009: 183-194
87EELila Kari, Shinnosuke Seki: On pseudoknot-bordered words and their properties. J. Comput. Syst. Sci. 75(2): 113-121 (2009)
86EELeonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. 38(6): 2356-2381 (2009)
85EELila Kari, Kalpana Mahalingam, Shinnosuke Seki: Twin-roots of words and their properties. Theor. Comput. Sci. 410(24-25): 2393-2400 (2009)
84EEElena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa: On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410(35): 3250-3260 (2009)
2008
83EEMasami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki: Duplication in DNA Sequences. Developments in Language Theory 2008: 419-430
82EEElena Czeizler, Lila Kari, Shinnosuke Seki: On a Special Class of Primitive Words. MFCS 2008: 265-277
81EELila Kari, Grzegorz Rozenberg: The many facets of natural computing. Commun. ACM 51(10): 72-83 (2008)
80EENatasa Jonoska, Lila Kari, Kalpana Mahalingam: Involution Solid and Join codes. Fundam. Inform. 86(1-2): 127-142 (2008)
79EELila Kari, Kalpana Mahalingam: Watson-Crick Bordered Words and their Syntactic Monoid. Int. J. Found. Comput. Sci. 19(5): 1163-1179 (2008)
78EELila Kari, Petr Sosík: On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008)
2007
77EELila Kari, Kalpana Mahalingam: Watson-Crick Conjugate and Commutative Words. DNA 2007: 273-283
76EELila Kari: Nanocomputing by Self-assembly. UC 2007: 27
75EELila Kari, Kalpana Mahalingam, Gabriel Thierrin: The syntactic monoid of hairpin-free languages. Acta Inf. 44(3-4): 153-166 (2007)
74EELila Kari, Kalpana Mahalingam: Involutively Bordered Words. Int. J. Found. Comput. Sci. 18(5): 1089-1106 (2007)
2006
73EELila Kari, Kalpana Mahalingam: DNA Codes and Their Properties. DNA 2006: 127-142
72EENatasa Jonoska, Lila Kari, Kalpana Mahalingam: Involution Solid and Join Codes. Developments in Language Theory 2006: 192-202
71EELila Kari, Kalpana Mahalingam: Involution Solid Codes. Nanotechnology: Science and Computation 2006: 137-146
70EELila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: A Formal Language Analysis of DNA Hairpin Structures. Fundam. Inform. 71(4): 453-475 (2006)
69EELila Kari, Elena Losseva: Block Substitutions and Their Properties. Fundam. Inform. 73(1-2): 165-178 (2006)
2005
68EELila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin: Hairpin Structures in DNA Words. DNA 2005: 158-170
67EELila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307
66EEHalina Kaminski, Lila Kari, Mark Perry: Who Counts Your Votes? EEE 2005: 598-603
65EECezar Câmpeanu, Lila Kari, Andrei Paun: Results on Transforming NFA into DFCA. Fundam. Inform. 64(1-4): 53-63 (2005)
64EELila Kari, Stavros Konstantinidis, Petr Sosík: Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16(3): 531-546 (2005)
63EELila Kari, Stavros Konstantinidis, Petr Sosík: Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005)
62EELila Kari, Stavros Konstantinidis: Language equations, maximality and error-detection. J. Comput. Syst. Sci. 70(1): 157-178 (2005)
61EERudolf Freund, Lila Kari, Marion Oswald, Petr Sosík: Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comput. Sci. 330(2): 251-266 (2005)
60EELila Kari, Petr Sosík: Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005)
59EELila Kari, Stavros Konstantinidis, Petr Sosík: On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005)
2004
58EELila Kari, Carlos Martín-Vide, Andrei Paun: On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing 2004: 254-265
57EELila Kari, Stavros Konstantinidis, Petr Sosík: Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212
56EELila Kari, Stavros Konstantinidis, Petr Sosík: Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181
55EELila Kari, Stavros Konstantinidis, Petr Sosík: Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191
54EELila Kari, Stavros Konstantinidis, Petr Sosík: Substitution on Trajectories. Theory Is Forever 2004: 145-158
53 Lila Kari, Petr Sosík: On Language Equations with Deletion. Bulletin of the EATCS 83: 173-180 (2004)
52 Lila Kari, Stavros Konstantinidis: Descriptional Complexity of Error/Edit Systems. Journal of Automata, Languages and Combinatorics 9(2/3): 293-309 (2004)
2003
51EELila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak: Sticky-free and overhang-free DNA languages. Acta Inf. 40(2): 119-157 (2003)
50 Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano: The ld and dlad Bio-Operations on Formal Languages. Journal of Automata, Languages and Combinatorics 8(3): 477-498 (2003)
49 Salah Hussini, Lila Kari, Stavros Konstantinidis: Coding properties of DNA languages. Theor. Comput. Sci. 290(3): 1557-1579 (2003)
48EEMark Daley, Oscar H. Ibarra, Lila Kari: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor. Comput. Sci. 306(1-3): 19-38 (2003)
2002
47EEMark Daley, Lila Kari: Some Properties of Ciliate Bio-operations. Developments in Language Theory 2002: 116-127
46EELeonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus: On the Decidability of Self-Assembly of Infinite Ribbons. FOCS 2002: 530-537
45EELila Kari, Rob Kitto, Gabriel Thierrin: Codes, Involutions, and DNA Encodings. Formal and Natural Computing 2002: 376-393
2001
44EESalah Hussini, Lila Kari, Stavros Konstantinidis: Coding Properties of DNA Languages. DNA 2001: 57-69
43 Lila Kari, Andrei Paun: String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287
42 Lila Kari: DNA Computers: Tomorrow's Reality. Current Trends in Theoretical Computer Science 2001: 811-829
41EELila Kari: DNA computing in vitro and in vivo. Future Generation Comp. Syst. 17(7): 823-834 (2001)
40EELila Kari, Rob Kitto, Greg Gloor: A computer scientist's guide to molecular biology. Soft Comput. 5(2): 95-101 (2001)
2000
39EELila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000)
38EEMasami Ito, Lila Kari, Gabriel Thierrin: Shuffle and scattered deletion closure of languages. Theor. Comput. Sci. 245(1): 115-133 (2000)
1999
37EELila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber: How to Compute with DNA. FSTTCS 1999: 269-282
36 Lila Kari, Hanan Lutfiyya, Carlos Martín-Vide, Gheorghe Paun: Bringing PC Grammar Systems Closer to Hoare's CSPs. Grammatical Models of Multi-Agent Systems 1999: 64-85
35 Lila Kari, Jarkko Kari, Laura F. Landweber: Reversible Molecular Computation in Ciliates. Jewels are Forever 1999: 353-363
34EEMark Daley, Lila Kari, Greg Gloor, Rani Siromoney: Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. SPIRE/CRIWG 1999: 47-54
33 Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu: Towards a DNA Solution to the Shortest Common Superstring Problem. International Journal on Artificial Intelligence Tools 8(4): 385-400 (1999)
32EERudolf Freund, Lila Kari, Gheorghe Paun: DNA Computing Based on Splicing: The Existence of Universal Computers. Theory Comput. Syst. 32(1): 69-112 (1999)
1998
31 Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65
30EELila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998)
1997
29 Lila Kari: From Micro-Soft to Bio-Soft: Computing With DNA. BCEC 1997: 146-164
28EEMasami Ito, Lila Kari, Gabriel Thierrin: Insertion and Deletion Closure of Languages. Theor. Comput. Sci. 183(1): 3-19 (1997)
1996
27 Erzsébet Csuhaj-Varjú, Lila Kari, Gheorghe Paun: Test Tube Distributed Systems Based on Splicing. Computers and Artificial Intelligence 15(2-3): (1996)
26 Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. Fundam. Inform. 25(3): 271-284 (1996)
25 Lila Kari, Gabriel Thierrin: Contextual Insertions/Deletions and Computability. Inf. Comput. 131(1): 47-61 (1996)
24 Lila Kari, Gabriel Thierrin: Maximal and Minimal Solutions to Language Equations. J. Comput. Syst. Sci. 53(3): 487-496 (1996)
23 Lila Kari, Gheorghe Paun, Arto Salomaa: The Power of Restricted Splicing with Rules from a Regular Language. J. UCS 2(4): 224-240 (1996)
22 Lila Kari, Gabriel Thierrin: Omega-Syntactic Congruences. Journal of Automata, Languages and Combinatorics 1(1): 13-26 (1996)
1995
21 Lila Kari, Gabriel Thierrin: Morphisms and Associated Congruences. Developments in Language Theory 1995: 119-128
20EELila Kari, Grzegorz Rozenberg, Arto Salomaa: Generalised DOL Trees. Acta Cybern. 12(1): 1-10 (1995)
19 Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: On Parallel Deletions Applied to a Word. ITA 29(2): 129-144 (1995)
18EELila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995)
1994
17EEJuraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432
16 Lila Kari: Power of Controlled Insertion and Deletion. Results and Trends in Theoretical Computer Science 1994: 197-212
15 Przemyslaw Prusinkiewicz, Lila Kari: Subapical Bracketed L-Systems. TAGT 1994: 550-564
14 Juraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. Theor. Comput. Sci. 127(1): 123-147 (1994)
13 Lila Kari: On Language Equations with Invertible Operations. Theor. Comput. Sci. 132(2): 129-150 (1994)
1993
12EEJuraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505
11 Lila Kari: Insertion operations: Closure properties. Bulletin of the EATCS 51: 181-191 (1993)
10 Lila Kari: Generalized Derivatives. Fundam. Inform. 18: 27-39 (1993)
9 Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Deletion Sets. Fundam. Inform. 19(3/4): 355-370 (1993)
8 Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993)
1992
7EELila Kari: Insertion and Deletion of Words: Determinism and Reversibility. MFCS 1992: 315-326
6 Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa: In the prehistory of formal language theory: Gauss Languages. Bulletin of the EATCS 46: 124-139 (1992)
5 Lila Santean, Jarkko Kari: The Impact of the Number of Cooperating Grammars on the Generative Power. Theor. Comput. Sci. 98(2): 249-262 (1992)
1991
4EEHannu Nurmi, Arto Salomaa, Lila Santean: Secret ballot elections in computer networks. Computers & Security 10(6): 553-560 (1991)
1990
3EELila Santean: A Hierarchy of Unary Primitive Recursive String-Functions. IMYCS 1990: 225-233
2 Lila Santean: Parallel Communicating Systems. Bulletin of the EATCS 42: 160-171 (1990)
1 Arto Salomaa, Lila Santean: Secret Selling of Secrets with Several Buyers. Bulletin of the EATCS 42: 178-186 (1990)

Coauthor Index

1Leonard M. Adleman [46] [86]
2Cezar Câmpeanu [65]
3Erzsébet Csuhaj-Varjú [27]
4Bo Cui [89]
5Elena Czeizler (Elena Petre) [82] [84] [88]
6Eugen Czeizler [84] [88]
7Mark Daley [34] [37] [47] [48] [50]
8Rudolf Freund [32] [61]
9Michelle Gaasenbeek [33]
10Greg Gloor [31] [33] [34] [37] [39] [40]
11Juraj Hromkovic [12] [14] [17] [26]
12Salah Hussini [44] [49]
13Oscar H. Ibarra [48] [50]
14Masami Ito [28] [38] [83]
15Natasa Jonoska (Natasha Jonoska) [72] [80]
16Halina Kaminski [66]
17Jarkko Kari [5] [12] [14] [17] [26] [35] [46] [86]
18Zachary Kincaid [83]
19Rob Kitto [40] [45]
20Stavros Konstantinidis [44] [49] [51] [52] [54] [55] [56] [57] [59] [62] [63] [64] [67] [68] [70]
21Laura F. Landweber [35] [37]
22Elena Losseva [51] [68] [69] [70]
23Hanan Lutfiyya (Hanan Lutfi Lutfiyya) [36]
24Kalpana Mahalingam [71] [72] [73] [74] [75] [77] [79] [80] [85]
25Solomon Marcus [6]
26Carlos Martín-Vide [36] [58]
27Alexandru Mateescu [8] [9] [18] [19]
28Ian McQuillan [50]
29Koji Nakano [50]
30Hannu Nurmi [4]
31Marion Oswald [61]
32Dana Pardubská [17] [26]
33Andrei Paun [43] [58] [65]
34Gheorghe Paun [6] [8] [9] [18] [19] [23] [27] [30] [32] [36]
35Mark Perry [66]
36Przemyslaw Prusinkiewicz [15]
37Dustin Reishus [46] [86]
38Grzegorz Rozenberg [20] [30] [81]
39Arto Salomaa [1] [4] [6] [8] [9] [18] [19] [20] [23] [30]
40Kai Salomaa [84]
41Shinnosuke Seki [82] [83] [85] [87] [88] [89]
42Rani Siromoney [34] [37]
43Petr Sosík [53] [54] [55] [56] [57] [59] [60] [61] [63] [64] [67] [68] [70] [78] [86]
44Gabriel Thierrin [21] [22] [24] [25] [28] [38] [45] [67] [68] [70] [75]
45Geoff Wozniak [51]
46Sheng Yu [30] [31] [33] [39]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)