default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLila Kari
Lila Santean
Person information
- affiliation: University of Western Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i24]Zahra Gharaee, Scott C. Lowe, ZeMing Gong, Pablo Millan Arias, Nicholas Pellegrino, Austin T. Wang, Joakim Bruslund Haurum, Iuliia Zarubiieva, Lila Kari, Dirk Steinke, Graham W. Taylor, Paul W. Fieguth, Angel X. Chang:
BIOSCAN-5M: A Multimodal Dataset for Insect Biodiversity. CoRR abs/2406.12723 (2024)- [i23]Fatemeh Alipour, Kathleen A. Hill, Lila Kari:
CGRclust: Chaos Game Representation for Twin Contrastive Clustering of Unlabelled DNA Sequences. CoRR abs/2407.02538 (2024) - 2023
- [j151]Pablo Millan Arias
, Kathleen A. Hill, Lila Kari:
iDeLUCS: a deep learning interactive tool for alignment-free clustering of DNA sequences. Bioinform. 39(9) (2023) - [j150]Lila Kari:
Editorial. Theor. Comput. Sci. 940(Part): 1 (2023) - [i22]Pablo Millan Arias, Niousha Sadjadi, Monireh Safari, ZeMing Gong, Austin T. Wang, Scott C. Lowe, Joakim Bruslund Haurum, Iuliia Zarubiieva, Dirk Steinke, Lila Kari, Angel X. Chang, Graham W. Taylor:
BarcodeBERT: Transformers for Biodiversity Analysis. CoRR abs/2311.02401 (2023) - 2022
- [j149]Lila Kari, Kalpana Mahalingam, Palak Pandoh, Zihao Wang:
Primitivity of Atom Watson-Crick Fibonacci Words. J. Autom. Lang. Comb. 27(1-3): 151-178 (2022) - [j148]Lila Kari:
Editorial. Theor. Comput. Sci. 908: 1 (2022) - [j147]Lila Kari:
Editorial. Theor. Comput. Sci. 920: iii (2022) - [j146]Lila Kari:
Editorial. Theor. Comput. Sci. 924: iii (2022) - [j145]Lila Kari:
Editorial. Theor. Comput. Sci. 926: iii (2022) - [c71]Lila Kari, Kalpana Mahalingam:
Watson-Crick Powers of a Word. CAI 2022: 136-148 - 2021
- [j144]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. Int. J. Found. Comput. Sci. 32(6): 685-711 (2021) - [j143]Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam, Zihao Wang:
Involutive Fibonacci Words. J. Autom. Lang. Comb. 26(3-4): 255-280 (2021) - [j142]Francesco Bellamoli, Giuditta Franco, Lila Kari, Silvia Lampis, Timothy Ng, Zihao Wang:
Conjugate word blending: formal model and experimental implementation by XPCR. Nat. Comput. 20(4): 647-658 (2021) - [j141]Lila Kari:
Editorial. Theor. Comput. Sci. 851: iii (2021) - [j140]Lila Kari, Ion Petre, Grzegorz Rozenberg, Arto Salomaa:
A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday. Theor. Comput. Sci. 862: 1-2 (2021) - [j139]Lila Kari:
Editorial. Theor. Comput. Sci. 862: iii (2021) - [j138]Lila Kari:
Editorial. Theor. Comput. Sci. 870: iii (2021) - [j137]Lila Kari:
Editorial. Theor. Comput. Sci. 872: iii (2021) - [j136]Lila Kari:
Editorial. Theor. Comput. Sci. 875: iii (2021) - [j135]Lila Kari:
Editorial. Theor. Comput. Sci. 881: iii (2021) - [j134]Lila Kari:
Editorial. Theor. Comput. Sci. 893: iii (2021) - [j133]Paola Bonizzoni, Lila Kari, Ion Petre, Grzegorz Rozenberg:
Building bridges - Honoring Nataša Jonoska on the occasion of her 60th birthday. Theor. Comput. Sci. 894: 1-2 (2021) - [j132]Lila Kari:
Editorial. Theor. Comput. Sci. 894: iii (2021) - 2020
- [j131]Gurjit S. Randhawa, Kathleen A. Hill, Lila Kari:
MLDSP-GUI: an alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis. Bioinform. 36(7): 2258-2259 (2020) - [j130]Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang:
Word Blending in Formal Languages. Fundam. Informaticae 171(1-4): 151-173 (2020) - [j129]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. Int. J. Found. Comput. Sci. 31(8): 1113-1132 (2020) - [j128]Lila Kari:
Editorial. Theor. Comput. Sci. 801: iii (2020) - [j127]Lila Kari:
Editorial. Theor. Comput. Sci. 805: iii (2020) - [j126]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 807: 1-2 (2020) - [j125]Lila Kari:
Editorial. Theor. Comput. Sci. 816: iii (2020) - [j124]Lila Kari:
Editorial. Theor. Comput. Sci. 817: iii (2020) - [j123]Lila Kari:
Editorial. Theor. Comput. Sci. 832: iii (2020) - [j122]Lila Kari:
Editorial. Theor. Comput. Sci. 843: iii (2020) - [c70]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-simple Splicing Systems. DLT 2020: 150-163
2010 – 2019
- 2019
- [j121]Lila Kari, Amirhossein Simjour:
Simplifying the role of signals in tile self-assembly. Nat. Comput. 18(2): 383-401 (2019) - [j120]Lila Kari:
Editorial. Theor. Comput. Sci. 765: iii (2019) - [j119]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 777: 1-2 (2019) - [j118]Lila Kari:
Editorial. Theor. Comput. Sci. 785: iii (2019) - [c69]Lila Kari, Timothy Ng:
State Complexity of Simple Splicing. DCFS 2019: 197-209 - [c68]Lila Kari, Timothy Ng:
State Complexity of Pseudocatenation. LATA 2019: 203-214 - [i21]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. CoRR abs/1909.02512 (2019) - 2018
- [j117]Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang:
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. Algorithms 11(11): 165 (2018) - [j116]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. Inf. Comput. 259(2): 237-258 (2018) - [j115]Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam:
Relative Watson-Crick Primitivity of Words. J. Autom. Lang. Comb. 23(1-3): 201-217 (2018) - [j114]Lila Kari:
Editorial. Theor. Comput. Sci. 724: iii (2018) - [j113]Lila Kari:
Editorial. Theor. Comput. Sci. 736: iii (2018) - [j112]Lila Kari:
Editorial. Theor. Comput. Sci. 752: iii (2018) - [c67]Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang:
Word Blending in Formal Languages: The Brangelina Effect. UCNC 2018: 72-85 - [c66]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CIAA 2018: 109-120 - 2017
- [j111]Lila Kari, Manasi S. Kulkarni:
Disjunctivity and other properties of sets of pseudo-bordered words. Acta Informatica 54(4): 379-398 (2017) - [j110]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-Hard. Algorithmica 78(1): 1-46 (2017) - [j109]Rallis Karamichalis, Lila Kari:
MoDMaps3D: an interactive webtool for the quantification and 3D visualization of interrelationships in a dataset of DNA sequences. Bioinform. 33(19): 3091-3093 (2017) - [j108]Lila Kari, Amirhossein Simjour:
Smart Tile Self-Assembly and Replication. Fundam. Informaticae 154(1-4): 239-260 (2017) - [j107]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Further remarks on DNA overlap assembly. Inf. Comput. 253: 143-154 (2017) - [j106]Lila Kari, Steffen Kopecki:
Deciding whether a regular language is generated by a splicing system. J. Comput. Syst. Sci. 84: 263-287 (2017) - [j105]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
On the overlap assembly of strings and languages. Nat. Comput. 16(1): 175-185 (2017) - [j104]Lila Kari:
Editorial. Theor. Comput. Sci. 671: 1 (2017) - [j103]Lila Kari:
Editorial. Theor. Comput. Sci. 682: 1 (2017) - [j102]Lila Kari:
Editorial. Theor. Comput. Sci. 701: 1 (2017) - [i20]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CoRR abs/1710.06000 (2017) - 2016
- [j101]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes:
Additive methods for genomic signatures. BMC Bioinform. 17: 313 (2016) - [j100]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Preface. Nat. Comput. 15(1): 1-3 (2016) - [j99]Lila Kari:
Editorial. Theor. Comput. Sci. 623: 1 (2016) - [j98]Lila Kari:
Editorial. Theor. Comput. Sci. 632: 1 (2016) - [j97]Lila Kari:
Editorial. Theor. Comput. Sci. 633: 1 (2016) - [j96]Lila Kari:
Editorial. Theor. Comput. Sci. 641: 1 (2016) - 2015
- [j95]Helmut Jürgensen, Lila Kari, Steffen Kopecki:
Methods for Relativizing Properties of Codes. Acta Cybern. 22(2): 259-292 (2015) - [j94]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
An investigation into inter- and intragenomic variations of graphic genomic signatures. BMC Bioinform. 16: 246:1-246:22 (2015) - [j93]Srujan Kumar Enaganti, Lila Kari, Steffen Kopecki:
A Formal Language Model of DNA Polymerase Enzymatic Activity. Fundam. Informaticae 138(1-2): 179-192 (2015) - [j92]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-color bounded patterned self-assembly. Nat. Comput. 14(2): 279-292 (2015) - [j91]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella:
TCS in the 21st century. Theor. Comput. Sci. 591: 3-4 (2015) - [j90]Lila Kari:
Editorial. Theor. Comput. Sci. 598: 1 (2015) - [j89]Lila Kari:
Editorial. Theor. Comput. Sci. 599: 1 (2015) - [j88]Lila Kari:
Editorial. Theor. Comput. Sci. 608: 1 (2015) - [c65]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. DCFS 2015: 141-152 - [c64]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-hard. ICALP (1) 2015: 1022-1034 - [i19]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. CoRR abs/1503.00035 (2015) - 2014
- [j87]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: a Theoretical Model for patterned Self-assembly. Int. J. Found. Comput. Sci. 25(4): 419-440 (2014) - [j86]Lila Kari, Manasi S. Kulkarni:
Generating the Pseudo-Powers of a Word. J. Autom. Lang. Comb. 19(1-4): 157-171 (2014) - [j85]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
On the maximality of languages with combined types of code properties. Theor. Comput. Sci. 550: 79-89 (2014) - [c63]Lila Kari, Manasi S. Kulkarni:
Pseudo-Identities and Bordered Words. Discrete Mathematics and Computer Science 2014: 207-222 - [e1]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, London, ON, Canada, July 14-18, 2014, Proceedings. Lecture Notes in Computer Science 8553, Springer 2014, ISBN 978-3-319-08122-9 [contents] - [i18]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary pattern tile set synthesis is NP-hard. CoRR abs/1404.0967 (2014) - [i17]Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang:
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR abs/1406.1041 (2014) - 2013
- [j84]David Doty, Lila Kari, Benoît Masson:
Negative Interactions in Irreversible Self-assembly. Algorithmica 66(1): 153-172 (2013) - [j83]Yuan Gao, Lila Kari:
State complexity of star of union and square of union on k regular languages. Theor. Comput. Sci. 499: 38-50 (2013) - [j82]Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
The Power of Nondeterminism in Self-Assembly. Theory Comput. 9: 1-29 (2013) - [c62]Lila Kari:
Negative Glues and Non-determinism in Nanocomputations by Self-assembly. CiE 2013: 271-272 - [c61]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-Color Bounded Patterned Self-assembly - (Extended Abstract). DNA 2013: 105-117 - [c60]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly. UCNC 2013: 125-137 - [i16]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly. CoRR abs/1302.2840 (2013) - [i15]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-color Bounded Patterned Self-assembly. CoRR abs/1306.3257 (2013) - [i14]Lila Kari, Kathleen A. Hill, Abu Sadat Sayem, Nathaniel Bryans, Katelyn Davis, Nikesh S. Dattani:
Map of Life: Measuring and Visualizing Species' Relatedness with "Molecular Distance Maps". CoRR abs/1307.3755 (2013) - 2012
- [j81]Ehsan Chiniforooshan, Lila Kari, Zhi Xu:
Pseudopower Avoidance. Fundam. Informaticae 114(1): 55-72 (2012) - [j80]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal. Int. J. Found. Comput. Sci. 23(1): 51-66 (2012) - [j79]Lila Kari, Zhi Xu:
De Bruijn Sequences Revisited. Int. J. Found. Comput. Sci. 23(6): 1307-1322 (2012) - [j78]Mark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam:
Relativized codes. Theor. Comput. Sci. 429: 54-64 (2012) - [j77]Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of star on k regular languages. Theor. Comput. Sci. 429: 98-107 (2012) - [j76]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State complexity of combined operations with two basic operations. Theor. Comput. Sci. 437: 82-102 (2012) - [j75]Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-reversal counter machines and multihead automata: Revisited. Theor. Comput. Sci. 454: 81-87 (2012) - [j74]Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of square and reversal on k regular languages. Theor. Comput. Sci. 454: 164-171 (2012) - [c59]Lila Kari, Shinnosuke Seki, Zhi Xu:
Triangular and Hexagonal Tile Self-assembly Systems. Computation, Physics and Beyond 2012: 357-375 - [c58]Yuan Gao, Lila Kari:
State Complexity of Star and Square of Union of k Regular Languages. DCFS 2012: 155-168 - [c57]Lila Kari, Steffen Kopecki:
Deciding Whether a Regular Language Is Generated by a Splicing System. DNA 2012: 98-109 - [c56]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
Iterated Hairpin Completions of Non-crossing Words. SOFSEM 2012: 337-348 - [p7]Lila Kari, Shinnosuke Seki, Petr Sosík:
DNA Computing - Foundations and Implications. Handbook of Natural Computing 2012: 1073-1127 - 2011
- [j73]Bo Cui, Lila Kari, Shinnosuke Seki:
K-Comma Codes and Their Generalizations. Fundam. Informaticae 107(1): 1-18 (2011) - [j72]Lila Kari, Shinnosuke Seki, Steffen Kopecki:
On the Regularity of Iterated Hairpin Completion of a Single Word. Fundam. Informaticae 110(1-4): 201-215 (2011) - [j71]Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki:
An extension of the Lyndon-Schützenberger result to pseudoperiodic words. Inf. Comput. 209(4): 717-730 (2011) - [j70]Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosík:
Orthogonal Shuffle on Trajectories. Int. J. Found. Comput. Sci. 22(1): 213-222 (2011) - [j69]Lila Kari, Benoît Masson, Shinnosuke Seki:
Properties of Pseudo-Primitive Words and their Applications. Int. J. Found. Comput. Sci. 22(2): 447-471 (2011) - [j68]Lila Kari, Shinnosuke Seki:
Schema for Parallel Insertion and Deletion: Revisited. Int. J. Found. Comput. Sci. 22(7): 1655-1668 (2011) - [j67]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection. Int. J. Found. Comput. Sci. 22(8): 1797-1812 (2011) - [j66]Eugen Czeizler, Lila Kari:
Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies. Nat. Comput. 10(1): 103-117 (2011) - [j65]Bo Cui, Lila Kari, Shinnosuke Seki:
Block insertion and deletion on trajectories. Theor. Comput. Sci. 412(8-10): 714-728 (2011) - [j64]Lila Kari, Benoît Masson:
Polyominoes simulating arbitrary-neighborhood zippers and tilings. Theor. Comput. Sci. 412(43): 6083-6100 (2011) - [c55]Lila Kari, Zhi Xu:
De Bruijn Sequences Revisited. AFL 2011: 241-254 - [c54]Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
The Power of Nondeterminism in Self-Assembly. SODA 2011: 590-602 - [c53]Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-Reversal Counter Machines and Multihead Automata: Revisited. SOFSEM 2011: 166-177 - [i13]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
On the regularity of iterated hairpin completion of a single word. CoRR abs/1104.2385 (2011) - [i12]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
Iterated Hairpin Completions of Non-crossing Words. CoRR abs/1110.0760 (2011) - [i11]Lila Kari, Steffen Kopecki:
Deciding if a Regular Language is Generated by a Splicing System. CoRR abs/1112.4897 (2011) - [i10]Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka:
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). Dagstuhl Reports 1(2): 47-66 (2011) - 2010
- [j63]Lila Kari, Shinnosuke Seki:
An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality. Fundam. Informaticae 101(3): 215-236 (2010) - [j62]Lila Kari, Kalpana Mahalingam:
Watson-Crick palindromes in DNA computing. Nat. Comput. 9(2): 297-316 (2010) - [j61]Elena Czeizler, Lila Kari, Shinnosuke Seki:
On a special class of primitive words. Theor. Comput. Sci. 411(3): 617-630 (2010) - [c52]Lila Kari:
DNA Computing and Its Implications for Theoretical Computer Science. Developments in Language Theory 2010: 32 - [c51]Lila Kari, Shinnosuke Seki:
Schema for Parallel Insertion and Deletion. Developments in Language Theory 2010: 267-278 - [c50]Ehsan Chiniforooshan, Lila Kari, Zhi Xu:
Pseudo-power Avoidance. Developments in Language Theory 2010: 432-433 - [c49]Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement. DNA 2010: 25-36 - [c48]David Doty, Lila Kari, Benoît Masson:
Negative Interactions in Irreversible Self-assembly. DNA 2010: 37-48 - [c47]Lila Kari, Shinnosuke Seki, Zhi Xu:
Triangular Tile Self-assembly Systems. DNA 2010: 89-99 - [c46]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Union and Intersection. CIAA 2010: 95-104 - [c45]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Star and Reversal. DCFS 2010: 58-67 - [c44]Lila Kari, Afroza Rahman:
Ciliate Gene Unscrambling with Fewer Templates. DCFS 2010: 120-129 - [i9]David Doty, Lila Kari, Benoît Masson:
Negative Interactions in Irreversible Self-Assembly. CoRR abs/1002.2746 (2010) - [i8]Lila Kari, Benoît Masson:
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings. CoRR abs/1002.3769 (2010) - [i7]Lila Kari, Benoît Masson, Shinnosuke Seki:
Properties of Pseudo-Primitive Words and their Applications. CoRR abs/1002.4084 (2010) - [i6]Lila Kari, Shinnosuke Seki, Zhi Xu:
Triangular Self-Assembly. CoRR abs/1002.4996 (2010) - [i5]Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement. CoRR abs/1003.3275 (2010) - [i4]Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
The Power of Nondeterminism in Self-Assembly. CoRR abs/1006.2897 (2010) - [i3]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation. CoRR abs/1006.4646 (2010) - [i2]Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
The Power of Nondeterminism in Self-Assembly. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j60]Eugen Czeizler, Lila Kari:
Geometrical tile design for complex neighborhoods. Frontiers Comput. Neurosci. 3: 20 (2009) - [j59]Lila Kari, Shinnosuke Seki:
On pseudoknot-bordered words and their properties. J. Comput. Syst. Sci. 75(2): 113-121 (2009) - [j58]Leonard 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) - [j57]Lila Kari, Kalpana Mahalingam, Shinnosuke Seki:
Twin-roots of words and their properties. Theor. Comput. Sci. 410(24-25): 2393-2400 (2009) - [j56]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410(35): 3250-3260 (2009) - [c43]Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki:
Duplication in DNA Sequences. Algorithmic Bioprocesses 2009: 43-61 - [c42]Bo Cui, Lila Kari, Shinnosuke Seki:
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. CAI 2009: 204-219 - [c41]Elena 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 - [i1]Ehsan Chiniforooshan, Lila Kari, Zhi Xu:
Pseudo-Power Avoidance. CoRR abs/0911.2233 (2009) - 2008
- [j55]Lila Kari, Grzegorz Rozenberg:
The many facets of natural computing. Commun. ACM 51(10): 72-83 (2008) - [j54]Natasa Jonoska, Lila Kari, Kalpana Mahalingam:
Involution Solid and Join codes. Fundam. Informaticae 86(1-2): 127-142 (2008) - [j53]Lila Kari, Kalpana Mahalingam:
Watson-Crick Bordered Words and their Syntactic Monoid. Int. J. Found. Comput. Sci. 19(5): 1163-1179 (2008) - [j52]Lila Kari, Petr Sosík:
On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008) - [c40]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133 - [c39]Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki:
Duplication in DNA Sequences. Developments in Language Theory 2008: 419-430 - [c38]Elena Czeizler, Lila Kari, Shinnosuke Seki:
On a Special Class of Primitive Words. MFCS 2008: 265-277 - 2007
- [j51]Lila Kari, Kalpana Mahalingam, Gabriel Thierrin:
The syntactic monoid of hairpin-free languages. Acta Informatica 44(3-4): 153-166 (2007) - [j50]Lila Kari, Kalpana Mahalingam:
Involutively Bordered Words. Int. J. Found. Comput. Sci. 18(5): 1089-1106 (2007) - [c37]Lila Kari, Kalpana Mahalingam:
Watson-Crick Conjugate and Commutative Words. DNA 2007: 273-283 - [c36]Lila Kari, Shinnosuke Seki:
Towards the Sequence Design Preventing Pseudoknot Formation. IWNC 2007: 101-110 - [c35]Lila Kari:
Nanocomputing by Self-assembly. UC 2007: 27 - 2006
- [j49]Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures. Fundam. Informaticae 71(4): 453-475 (2006) - [j48]Lila Kari, Elena Losseva:
Block Substitutions and Their Properties. Fundam. Informaticae 73(1-2): 165-178 (2006) - [c34]Natasa Jonoska, Lila Kari, Kalpana Mahalingam:
Involution Solid and Join Codes. Developments in Language Theory 2006: 192-202 - [c33]Lila Kari, Kalpana Mahalingam:
DNA Codes and Their Properties. DNA 2006: 127-142 - [c32]Lila Kari, Kalpana Mahalingam:
Involution Solid Codes. Nanotechnology: Science and Computation 2006: 137-146 - 2005
- [j47]Cezar Câmpeanu, Lila Kari, Andrei Paun:
Results on Transforming NFA into DFCA. Fundam. Informaticae 64(1-4): 53-63 (2005) - [j46]Lila 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) - [j45]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005) - [j44]Lila Kari, Stavros Konstantinidis:
Language equations, maximality and error-detection. J. Comput. Syst. Sci. 70(1): 157-178 (2005) - [j43]Rudolf 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) - [j42]Lila Kari, Petr Sosík:
Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005) - [j41]Lila Kari, Stavros Konstantinidis, Petr Sosík:
On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005) - [c31]Lila Kari, Petr Sosík:
On Weight of Universal Insertion Grammars. DCFS 2005: 206-214 - [c30]Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307 - [c29]Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin:
Hairpin Structures in DNA Words. DNA 2005: 158-170 - [c28]Halina Kaminski, Lila Kari, Mark Perry:
Who Counts Your Votes? EEE 2005: 598-603 - 2004
- [j40]Lila Kari, Petr Sosík:
On Language Equations with Deletion. Bull. EATCS 83: 173-180 (2004) - [j39]Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. J. Autom. Lang. Comb. 9(2/3): 293-309 (2004) - [j38]Mark Daley, Lila Kari, Ian McQuillan:
Families of languages defined by ciliate bio-operations. Theor. Comput. Sci. 320(1): 51-69 (2004) - [c27]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Substitution on Trajectories. Theory Is Forever 2004: 145-158 - [c26]Lila 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 - [c25]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181 - [c24]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191 - [c23]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212 - [p6]Lila Kari, Laura F. Landweber:
Biocomputation in Ciliates. Cellular Computing 2004: 202-216 - 2003
- [j37]Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak:
Sticky-free and overhang-free DNA languages. Acta Informatica 40(2): 119-157 (2003) - [j36]Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano:
The LD and DLAD Bio-Operations on Formal Languages. J. Autom. Lang. Comb. 8(3): 477-498 (2003) - [j35]Salah Hussini, Lila Kari, Stavros Konstantinidis:
Coding properties of DNA languages. Theor. Comput. Sci. 290(3): 1557-1579 (2003) - [j34]Mark 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
- [c22]Lila Kari, Rob Kitto, Gabriel Thierrin:
Codes, Involutions, and DNA Encodings. Formal and Natural Computing 2002: 376-393 - [c21]Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. DCFS 2002: 133-147 - [c20]Mark Daley, Lila Kari:
Some Properties of Ciliate Bio-operations. Developments in Language Theory 2002: 116-127 - [c19]Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus:
On the Decidability of Self-Assembly of Infinite Ribbons. FOCS 2002: 530-537 - 2001
- [j33]Lila Kari:
DNA computing in vitro and in vivo. Future Gener. Comput. Syst. 17(7): 823-834 (2001) - [j32]Helmut Jürgensen, Lila Kari, Gabriel Thierrin:
Morphisms preserving densities. Int. J. Comput. Math. 78(2): 65-189 (2001) - [j31]Lila Kari, Rob Kitto, Greg Gloor:
A computer scientist's guide to molecular biology. Soft Comput. 5(2): 95-101 (2001) - [c18]Lila Kari, Andrei Paun:
String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287 - [c17]Jarkko Kari, Lila Kari:
Context-free recombinations. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 361-375 - [c16]Salah Hussini, Lila Kari, Stavros Konstantinidis:
Coding Properties of DNA Languages. DNA 2001: 57-69 - [p5]Lila Kari:
DNA Computers: Tomorrow's Reality. Current Trends in Theoretical Computer Science 2001: 811-829 - 2000
- [j30]Lila Kari:
Half century of automata theory. SIGACT News 31(4): 121-124 (2000) - [j29]Lila Kari, Greg Gloor, Sheng Yu:
Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000) - [j28]Masami Ito, Lila Kari, Gabriel Thierrin:
Shuffle and scattered deletion closure of languages. Theor. Comput. Sci. 245(1): 115-133 (2000)
1990 – 1999
- 1999
- [j27]Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu:
Towards a DNA Solution to the Shortest Common Superstring Problem. Int. J. Artif. Intell. Tools 8(4): 385-400 (1999) - [j26]Rudolf Freund, Lila Kari, Gheorghe Paun:
DNA Computing Based on Splicing: The Existence of Universal Computers. Theory Comput. Syst. 32(1): 69-112 (1999) - [c15]Lila Kari, Jarkko Kari, Laura F. Landweber:
Reversible Molecular Computation in Ciliates. Jewels are Forever 1999: 353-363 - [c14]Lila Kari, Laura F. Landweber:
Computational power of gene rearrangement. DNA Based Computers 1999: 207-216 - [c13]Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber:
How to Compute with DNA. FSTTCS 1999: 269-282 - [c12]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 - [c11]Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney:
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. SPIRE/CRIWG 1999: 47-54 - 1998
- [j25]Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu:
DNA Computing, Sticker Systems, and Universality. Acta Informatica 35(5): 401-420 (1998) - [c10]Lila Kari, Greg Gloor, Sheng Yu:
Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65 - 1997
- [j24]Masami Ito, Lila Kari, Gabriel Thierrin:
Insertion and Deletion Closure of Languages. Theor. Comput. Sci. 183(1): 3-19 (1997) - [c9]Lila Kari:
From Micro-Soft to Bio-Soft: Computing With DNA. BCEC 1997: 146-164 - [c8]Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. DNA Based Computers 1997: 329-346 - [p4]Lila Kari, Grzegorz Rozenberg, Arto Salomaa:
L Systems. Handbook of Formal Languages (1) 1997: 253-328 - 1996
- [j23]Erzsébet Csuhaj-Varjú, Lila Kari, Gheorghe Paun:
Test Tube Distributed Systems Based on Splicing. Comput. Artif. Intell. 15(2-3): 211-232 (1996) - [j22]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages. Fundam. Informaticae 25(3): 271-284 (1996) - [j21]Lila Kari, Gabriel Thierrin:
Contextual Insertions/Deletions and Computability. Inf. Comput. 131(1): 47-61 (1996) - [j20]Lila Kari, Gabriel Thierrin:
Omega-Syntactic Congruences. J. Autom. Lang. Comb. 1(1): 13-26 (1996) - [j19]Lila Kari, Gabriel Thierrin:
Maximal and Minimal Solutions to Language Equations. J. Comput. Syst. Sci. 53(3): 487-496 (1996) - [j18]Lila Kari, Gheorghe Paun, Arto Salomaa:
The Power of Restricted Splicing with Rules from a Regular Language. J. Univers. Comput. Sci. 2(4): 224-240 (1996) - 1995
- [j17]Lila Kari, Grzegorz Rozenberg, Arto Salomaa:
Generalised DOL Trees. Acta Cybern. 12(1): 1-9 (1995) - [j16]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
On Parallel Deletions Applied to a Word. RAIRO Theor. Informatics Appl. 29(2): 129-144 (1995) - [j15]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Teams in cooperating grammar systems. J. Exp. Theor. Artif. Intell. 7(4): 347-359 (1995) - [j14]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995) - [c7]Lila Kari, Gabriel Thierrin:
Morphisms and Associated Congruences. Developments in Language Theory 1995: 119-128 - 1994
- [j13]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) - [j12]Lila Kari:
On Language Equations with Invertible Operations. Theor. Comput. Sci. 132(2): 129-150 (1994) - [c6]Lila Kari:
Power of Controlled Insertion and Deletion. Results and Trends in Theoretical Computer Science 1994: 197-212 - [c5]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432 - [c4]Przemyslaw Prusinkiewicz, Lila Kari:
Subapical Bracketed L-Systems. TAGT 1994: 550-564 - [p3]Lila Kari, Gabriel Thierrin:
Aperiodic Languages and Generalizations. Mathematical Aspects of Natural and Formal Languages 1994: 233-243 - 1993
- [j11]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993) - [j10]Lila Kari:
Insertion operations: Closure properties. Bull. EATCS 51: 181-191 (1993) - [j9]Lila Kari:
Generalized Derivatives. Fundam. Informaticae 18: 27-39 (1993) - [j8]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Deletion Sets. Fundam. Informaticae 19(3/4): 355-370 (1993) - [c3]Juraj Hromkovic, Jarkko Kari, Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505 - [p2]Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa:
In the prehistory of formal language theory: Gauss languages. Current Trends in Theoretical Computer Science 1993: 551-562 - [p1]Lila Santean:
Parallel Communicating Grammar Systems. Current Trends in Theoretical Computer Science 1993: 603-615 - 1992
- [j7]Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa:
In the prehistory of formal language theory: Gauss Languages. Bull. EATCS 46: 124-139 (1992) - [j6]Lila Santean, Jarkko Kari:
The Impact of the Number of Cooperating Grammars on the Generative Power. Theor. Comput. Sci. 98(2): 249-262 (1992) - [c2]Lila Kari:
Insertion and Deletion of Words: Determinism and Reversibility. MFCS 1992: 315-326 - 1991
- [j5]Hannu Nurmi, Arto Salomaa, Lila Santean:
Secret ballot elections in computer networks. Comput. Secur. 10(6): 553-560 (1991) - 1990
- [j4]Lila Santean:
Parallel Communicating Systems. Bull. EATCS 42: 160-171 (1990) - [j3]Arto Salomaa, Lila Santean:
Secret Selling of Secrets with Several Buyers. Bull. EATCS 42: 178-186 (1990) - [j2]Gheorghe Paun, Lila Santean:
Further remarks on parallel communicating grammar systems. Int. J. Comput. Math. 34(3-4): 187-203 (1990) - [j1]Cristian Calude, Lila Santean:
On a theorem of Günter Asser. Math. Log. Q. 36(2): 143-147 (1990) - [c1]Lila Santean:
A Hierarchy of Unary Primitive Recursive String-Functions. IMYCS 1990: 225-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
