Lila Kari

发表

Circular contextual insertions/deletions with applications to biomolecular computation

Rani Siromoney, Mark Daley, Lila Kari, 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

One-reversal counter machines and multihead automata: Revisited

Oscar H. Ibarra, Mark Daley, Lila Kari, 2011, Theor. Comput. Sci..

Additive methods for genomic signatures

Lila Kari, Rallis Karamichalis, Stavros Konstantinidis, 2016, BMC Bioinformatics.

Involution Solid Codes

Lila Kari, Kalpana Mahalingam, L. Kari, 2006, Nanotechnology: Science and Computation.

An investigation into inter- and intragenomic variations of graphic genomic signatures

Lila Kari, Rallis Karamichalis, Stavros Konstantinidis, 2015, BMC Bioinformatics.

Two Lower Bounds on Distributive Generation of Languages

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1996, Fundam. Informaticae.

Schema for Parallel Insertion and Deletion: Revisited

Lila Kari, Shinnosuke Seki, L. Kari, 2011, Int. J. Found. Comput. Sci..

Block Substitutions and Their Properties

Lila Kari, Elena Losseva, L. Kari, 2006, Fundam. Informaticae.

Pseudo-Identities and Bordered Words

Lila Kari, Manasi S. Kulkarni, 2014, Discrete Mathematics and Computer Science.

DNA Computers: Tomorrow's Reality

Lila Kari, L. Kari, 2001, Current Trends in Theoretical Computer Science.

Contextual Insertions/Deletions and Computability

Lila Kari, Gabriel Thierrin, L. Kari, 1996, Inf. Comput..

An open-source k-mer based machine learning tool for fast and accurate subtyping of HIV-1 genomes

Lila Kari, Stephen Solis-Reyes, Mariano Avino, 2018 .

State Complexity of Overlap Assembly pdf

Lila Kari, Janusz A. Brzozowski, Bai Li, 2018, CIAA.

A Formal Language Analysis of DNA Hairpin Structures

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2006, Fundam. Informaticae.

Further remarks on DNA overlap assembly

Oscar H. Ibarra, Lila Kari, Steffen Kopecki, 2017, Inf. Comput..

On Language Equations with Invertible Operations

Lila Kari, L. Kari, 1994, Theor. Comput. Sci..

The many facets of natural computing

Grzegorz Rozenberg, Lila Kari, G. Rozenberg, 2008, Commun. ACM.

Power of Controlled Insertion and Deletion

Lila Kari, L. Kari, 1994, Results and Trends in Theoretical Computer Science.

On the weight of universal insertion grammars

Lila Kari, Petr Sosík, L. Kari, 2008, Theor. Comput. Sci..

On a special class of primitive words

Lila Kari, Shinnosuke Seki, Elena Czeizler, 2010, Theor. Comput. Sci..

Generalised DOL Trees

Grzegorz Rozenberg, Lila Kari, Arto Salomaa, 1995, Acta Cybern..

Binary Pattern Tile Set Synthesis Is NP-Hard

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2014, Algorithmica.

Test Tube Distributed Systems Based on Splicing

Erzsébet Csuhaj-Varjú, Gheorghe Paun, Lila Kari, 1996, Comput. Artif. Intell..

Nanocomputing by Self-assembly

Lila Kari, 2007, UC.

Secret Selling of Secrets with Several Buyers

Lila Kari, Arto Salomaa, 1990, Bull. EATCS.

Bond-Free Languages: Formalizations, Maximality and Construction Methods

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2004, DNA.

Editorial

Lila Kari, 2020, Theor. Comput. Sci..

Some Properties of Ciliate Bio-operations

Mark Daley, Lila Kari, 2002, Developments in Language Theory.

State complexity of union and intersection of star on k regular languages

Yuan Gao, Lila Kari, Sheng Yu, 2012, Theor. Comput. Sci..

The Impact of the Number of Cooperating Grammars on the Generative Power

Jarkko Kari, Lila Kari, L. Kari, 1992, Theor. Comput. Sci..

Watson–Crick palindromes in DNA computing

Lila Kari, Kalpana Mahalingam, L. Kari, 2010, Natural Computing.

An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality

Lila Kari, Shinnosuke Seki, 2010, Fundam. Informaticae.

State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal

Yuan Gao, Lila Kari, Sheng Yu, 2012, Int. J. Found. Comput. Sci..

Computationally universal P systems without priorities: two catalysts are sufficient

Rudolf Freund, Lila Kari, Marion Oswald, 2005, Theor. Comput. Sci..

SUBAPICAL L-SYSTEMS

Przemyslaw Prusinkiewicz, Lila Kari, 1995 .

Triangular and Hexagonal Tile Self-assembly Systems

Zhi Xu, Lila Kari, Shinnosuke Seki, 2012, Computation, Physics and Beyond.

On the decidability of self-assembly of infinite ribbons

Jarkko Kari, Lila Kari, Leonard M. Adleman, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

On a Special Class of Primitive Words

Lila Kari, Shinnosuke Seki, Elena Czeizler, 2008, MFCS.

De Bruijn Sequences Revisited

Zhi Xu, Lila Kari, L. Kari, 2012, Int. J. Found. Comput. Sci..

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly

Jarkko Kari, Lila Kari, Petr Sosík, 2009, SIAM J. Comput..

State Complexity of Pseudocatenation

Lila Kari, Timothy Ng, L. Kari, 2019, LATA.

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes

Lila Kari, Shinnosuke Seki, Bo Cui, 2009, CAI.

Block insertion and deletion on trajectories

Lila Kari, Shinnosuke Seki, Bo Cui, 2011, Theor. Comput. Sci..

On the maximality of languages with combined types of code properties

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, 2014, Theor. Comput. Sci..

A computer scientist's guide to molecular biology

Lila Kari, Greg Gloor, Rob Kitto, 2001, Soft Comput..

Relative Watson-Crick Primitivity of Words

Lila Kari, Kalpana Mahalingam, Manasi S. Kulkarni, 2018, J. Autom. Lang. Comb..

Negative Glues and Non-determinism in Nanocomputations by Self-assembly

Lila Kari, 2013, CiE.

Codes, Involutions, and DNA Encodings

Lila Kari, Gabriel Thierrin, Rob Kitto, 2002, Formal and Natural Computing.

Deciding whether a regular language is generated by a splicing system

Lila Kari, Steffen Kopecki, 2017, J. Comput. Syst. Sci..

A Hierarchy of Unary Primitive Recursive String-Functions

Lila Kari, 1990, IMYCS.

Hypergraph Automata: a Theoretical Model for patterned Self-assembly pdf

Lila Kari, Steffen Kopecki, Amirhossein Simjour, 2013, Int. J. Found. Comput. Sci..

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, 2015, DCFS.

Sticky-free and overhang-free DNA languages

Lila Kari, Stavros Konstantinidis, Elena Losseva, 2003, Acta Informatica.

Gramars with Oracles

Gheorghe Paun, Lila Kari, Arto Salomaa, 1993, Sci. Ann. Cuza Univ..

Aspects of shuffle and deletion on trajectories

Lila Kari, Petr Sosík, L. Kari, 2005, Theor. Comput. Sci..

DNA Computing: Models and Implementations

Lila Kari, Mark Daley, L. Kari, 2002 .

The syntactic monoid of hairpin-free languages

Lila Kari, Kalpana Mahalingam, Gabriel Thierrin, 2007, Acta Informatica.

On properties of bond-free DNA languages

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2005, Theor. Comput. Sci..

Secret ballot elections in computer networks

Lila Kari, Arto Salomaa, Hannu Nurmi, 1991, Computers & security.

Families of languages defined by ciliate bio-operations

Mark Daley, Lila Kari, Ian McQuillan, 2004, Theor. Comput. Sci..

Schema for Parallel Insertion and Deletion

Lila Kari, Shinnosuke Seki, L. Kari, 2010, Developments in Language Theory.

Multi-Pattern Languages

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, Theor. Comput. Sci..

Unconventional computation and natural computation : 13th international conference, UCNC 2014, London, ON, Canada, July 14-18, 2014 : proceedings

Oscar H. Ibarra, Lila Kari, Steffen Kopecki, 2014 .

Further remarks on parallel communicating grammar systems

Gheorghe Paun, Lila Kari, G. Paun, 1990, Int. J. Comput. Math..

Involutively Bordered Words

Lila Kari, Kalpana Mahalingam, 2007, Int. J. Found. Comput. Sci..

Using DNA to solve the Bounded Post Correspondence Problem

Lila Kari, Greg Gloor, Sheng Yu, 2000, MCU.

State Complexity of Combined Operations with Two Basic Operations

Yuan Gao, Lila Kari, Sheng Yu, 2022 .

TCS in the 21st century

Grzegorz Rozenberg, Lila Kari, Giorgio Ausiello, 2015, Theor. Comput. Sci..

ML-DSP: Machine Learning with Digital Signal Processing for ultrafast, accurate, and scalable genome classification at all taxonomic levels

Lila Kari, Gurjit S. Randhawa, Kathleen A. Hill, 2018 .

Triangular Self-Assembly pdf

Zhi Xu, Lila Kari, Shinnosuke Seki, 2010, ArXiv.

Bond-Free Languages: Formalizations, Maximality and Construction Methods

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2004, DNA.

Word Blending in Formal Languages: The Brangelina Effect

Zihao Wang, Lila Kari, Timothy Ng, 2018, UCNC.

Omega-Syntactic Congruences

Lila Kari, Gabriel Thierrin, 1996, J. Autom. Lang. Comb..

Duplication in DNA Sequences

Lila Kari, Shinnosuke Seki, Zachary Kincaid, 2008, International Conference on Developments in Language Theory.

Bringing PC Grammar Systems Closer to Hoare's CSPs

Hanan Lutfiyya, Carlos Martín-Vide, Gheorghe Paun, 1999, Grammatical Models of Multi-Agent Systems.

Deletion Sets

Gheorghe Paun, Lila Kari, Arto Salomaa, 1993, Fundam. Informaticae.

State Complexity of Overlap Assembly

Lila Kari, Janusz A. Brzozowski, Bai Li, 2017, CIAA.

Half century of automata theory

Lila Kari, L. Kari, 2000, SIGA.

An open-source k-mer based machine learning tool for fast and accurate subtyping of HIV-1 genomes

Lila Kari, Stephen Solis-Reyes, Mariano Avino, 2018, bioRxiv.

State Complexity of Star and Square of Union of k Regular Languages

Yuan Gao, Lila Kari, 2012, DCFS.

Smart Tile Self-Assembly and Replication

Lila Kari, Amirhossein Simjour, L. Kari, 2017, Fundam. Informaticae.

Preface

Paul G. Spirakis, Grzegorz Rozenberg, Lila Kari, 2020, Theor. Comput. Sci..

Maximal and Minimal Solutions to Language Equations

Lila Kari, Gabriel Thierrin, L. Kari, 1996, J. Comput. Syst. Sci..

Editorial

Lila Kari, 2020, Theor. Comput. Sci..

Simplifying the role of signals in tile self-assembly

Lila Kari, Amirhossein Simjour, 2018, Natural Computing.

3-Color Bounded Patterned Self-assembly - (Extended Abstract)

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2013, DNA.

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, 2018, Inf. Comput..

On Hairpin-Free Words and Languages

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2005, Developments in Language Theory.

Editorial

Lila Kari, 2020, Theor. Comput. Sci..

On the Regularity of Iterated Hairpin Completion of a Single Word

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2011, Fundam. Informaticae.

On Language Equations with Deletion

Lila Kari, Petr Sosík, 2004, Bull. EATCS.

Biocomputation in Ciliates

Lila Kari, Laura F. Landweber, 2004, Cellular Computing.

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers pdf

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, 2014, ArXiv.

Methods for Relativizing Properties of Codes

Lila Kari, Steffen Kopecki, Helmut Jürgensen, 2015, Acta Cybern..

Morphisms and Associated Congruences

Lila Kari, Gabriel Thierrin, 1995, Developments in Language Theory.

Binary Pattern Tile Set Synthesis Is NP-hard

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2015, ICALP.

A Formal Language Model of DNA Polymerase Enzymatic Activity

Lila Kari, Steffen Kopecki, Srujan Kumar Enaganti, 2015, Fundam. Informaticae.

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement pdf

Lila Kari, Ehsan Chiniforooshan, Shinnosuke Seki, 2010, DNA.

Morphisms preserving densities

Lila Kari, Helmut Jürgensen, Gabriel Thierrin, 2001, Int. J. Comput. Math..

K-Comma Codes and Their Generalizations

Lila Kari, Shinnosuke Seki, Bo Cui, 2011, Fundam. Informaticae.

Substitutions, Trajectories and Noisy Channels

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2004, CIAA.

Biocomputing: an application for micro-arrays?

Lila Kari, 2001, SIGB.

Properties of Pseudo-Primitive Words and their Applications

Lila Kari, Shinnosuke Seki, Benoît Masson, 2010, Int. J. Found. Comput. Sci..

Deciding if a Regular Language is Generated by a Splicing System pdf

Lila Kari, Steffen Kopecki, 2011, ArXiv.

3-color bounded patterned self-assembly

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2014, Natural Computing.

Negative Interactions in Irreversible Self-assembly

Lila Kari, Benoît Masson, David Doty, 2010, Algorithmica.

In the prehistory of formal language theory: Gauss Languages

Gheorghe Paun, Lila Kari, Arto Salomaa, 1992, Bull. EATCS.

Towards a DNA Solution to the Shortest Common Superstring Problem

Lila Kari, Greg Gloor, Sheng Yu, 1999, Int. J. Artif. Intell. Tools.

Language equations, maximality and error-detection

Lila Kari, Stavros Konstantinidis, L. Kari, 2005, J. Comput. Syst. Sci..

State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection

Yuan Gao, Lila Kari, Sheng Yu, 2011, Int. J. Found. Comput. Sci..

Towards a DNA solution to the shortest common superstring problem

Lila Kari, Greg Gloor, Sheng Yu, 1998, Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174).

Preface

Oscar H. Ibarra, Lila Kari, Steffen Kopecki, 2015, Natural Computing.

The LD and DLAD Bio-Operations on Formal Languages

Oscar H. Ibarra, Mark Daley, Lila Kari, 2003, J. Autom. Lang. Comb..

Two Lower Bounds on Distributive Generation of Languages

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1994, Fundam. Informaticae.

Insertion and Deletion of Words: Determinism and Reversibility

Lila Kari, L. Kari, 1992, MFCS.

Who counts your votes? [VEV electronic voting system]

Lila Kari, Mark Perry, Halina Kaminski, 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

The Power of Restricted Splicing with Rules from a Regular Language

Gheorghe Paun, Lila Kari, Arto Salomaa, 1996, J. Univers. Comput. Sci..

Substitution on Trajectories

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2004, Theory Is Forever.

DNA Computing and Its Implications for Theoretical Computer Science

Lila Kari, 2010, Developments in Language Theory.

Generating the Pseudo-Powers of a Word

Lila Kari, Manasi S. Kulkarni, L. Kari, 2014, J. Autom. Lang. Comb..

Insertion operations: Closure properties

Lila Kari, L. Kari, 1993, Bull. EATCS.

State Complexity of Catenation Combined with Star and Reversal

Yuan Gao, Lila Kari, Sheng Yu, 2010, DCFS.

MLDSP-GUI: An alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis

Lila Kari, Gurjit S. Randhawa, Kathleen A. Hill, 2020, Bioinform..

Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies

Lila Kari, Eugen Czeizler, 2010, Natural Computing.

Iterated Hairpin Completions of Non-crossing Words pdf

Lila Kari, Shinnosuke Seki, Steffen Kopecki, 2011, SOFSEM.

MLDSP-GUI: An alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis.

Lila Kari, Kathleen A Hill, Gurjit S Randhawa, 2019, Bioinformatics.

Parallel Communicating Grammar Systems

Lila Kari, 1993, Current Trends in Theoretical Computer Science.

Natural computing builds a bridge between computer science and natural sciences

Grzegorz Rozenberg, Lila Kari, 2008 .

DNA Computing - Foundations and Implications

Lila Kari, Shinnosuke Seki, Petr Sosík, 2012, Handbook of Natural Computing.

Watson-Crick Conjugate and Commutative Words

Lila Kari, Kalpana Mahalingam, L. Kari, 2007, DNA.

From Micro-Soft to Bio-Soft: Computing With DNA

Lila Kari, L. Kari, 1997, BCEC.

Relativized codes

Mark Daley, Lila Kari, Helmut Jürgensen, 2012, Theor. Comput. Sci..

Pseudo-power Avoidance pdf

Zhi Xu, Lila Kari, Ehsan Chiniforooshan, 2009, Developments in Language Theory.

State complexity of star of union and square of union on k regular languages

Yuan Gao, Lila Kari, L. Kari, 2013, Theor. Comput. Sci..

State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation pdf

Yuan Gao, Lila Kari, Sheng Yu, 2010, ArXiv.

String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation

Andrei Paun, Lila Kari, 2001, Words, Semigroups, and Transductions.

Map of Life: Measuring and Visualizing Species' Relatedness with "Molecular Distance Maps" pdf

Nikesh S. Dattani, Lila Kari, Kathleen A. Hill, 2013, ArXiv.

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers

Meng Yang, Lila Kari, Stavros Konstantinidis, 2018, Algorithms.

The power of nondeterminism in self-assembly

Lila Kari, Ehsan Chiniforooshan, Shinnosuke Seki, 2011, SODA '11.

Coding Properties of DNA Languages

Lila Kari, Stavros Konstantinidis, Salah Hussini, 2001, DNA.

Descriptional Complexity of Error/Edit Systems

Lila Kari, Stavros Konstantinidis, 2002, DCFS.

Towards the Sequence Design Preventing Pseudoknot Formation

Lila Kari, Shinnosuke Seki, 2007, IWNC.

On a theorem of Günter Asser

Cristian S. Calude, Lila Kari, L. Kari, 1990, Math. Log. Q..

Teams in cooperating grammar systems

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, J. Exp. Theor. Artif. Intell..

On the overlap assembly of strings and languages

Oscar H. Ibarra, Lila Kari, Steffen Kopecki, 2017, Natural Computing.

Operations on trajectories with applications to coding and bioinformatics

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2005, Int. J. Found. Comput. Sci..

DNA computing in vitro and in vivo

Lila Kari, 2001, Future Gener. Comput. Syst..

Disjunctivity and other properties of sets of pseudo-bordered words

Lila Kari, Manasi S. Kulkarni, 2016, Acta Informatica.

Coding properties of DNA languages

Lila Kari, Stavros Konstantinidis, Salah Hussini, 2003, Theor. Comput. Sci..

Editorial

Lila Kari, 2020, Theor. Comput. Sci..

Watson-Crick Bordered Words and their Syntactic Monoid

Lila Kari, Kalpana Mahalingam, 2008, Int. J. Found. Comput. Sci..

Shuffle and scattered deletion closure of languages

Lila Kari, Masami Ito, Gabriel Thierrin, 2000, Theor. Comput. Sci..

Ciliate Gene Unscrambling with Fewer Templates

Lila Kari, Afroza Rahman, 2010, DCFS.

Deciding Whether a Regular Language Is Generated by a Splicing System

Lila Kari, Steffen Kopecki, 2012, DNA.

Orthogonal Shuffle on Trajectories

Mark Daley, Lila Kari, Shinnosuke Seki, 2011, Int. J. Found. Comput. Sci..

State Complexity of Simple Splicing

Lila Kari, Timothy Ng, 2019, DCFS.

Insertion and Deletion Closure of Languages

Lila Kari, Masami Ito, Gabriel Thierrin, 1997, Theor. Comput. Sci..

DNA computing: a research snapshot

Lila Kari, Kalpana Mahalingam, L. Kari, 2010 .

Descriptional Complexity of Semi-simple Splicing Systems

Lila Kari, Timothy Ng, 2020, DLT.

Watson-Crick automata: determinism and state complexity

Lila Kari, Kai Salomaa, Eugen Czeizler, 2008, DCFS.

DNA computing, sticker systems, and universality

Gheorghe Paun, Grzegorz Rozenberg, Lila Kari, 1998, Acta Informatica.

On pseudoknot-bordered words and their properties

Lila Kari, Shinnosuke Seki, 2009, J. Comput. Syst. Sci..

Unconventional Computation and Natural Computation

Oscar H. Ibarra, Lila Kari, Steffen Kopecki, 2014, Lecture Notes in Computer Science.

An extension of the Lyndon-Schützenberger result to pseudoperiodic words

Lila Kari, Shinnosuke Seki, Eugen Czeizler, 2011, Inf. Comput..

Hairpin Structures in DNA Words

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2005, DNA.

On the descriptional complexity of Watson-Crick automata

Lila Kari, Kai Salomaa, Eugen Czeizler, 2009, Theor. Comput. Sci..

Triangular Tile Self-assembly Systems

Zhi Xu, Lila Kari, Shinnosuke Seki, 2010, DNA.

DNA Codes and Their Properties

Lila Kari, Kalpana Mahalingam, 2006, DNA.

Predicate Calculus

Lila Kari, 2009, Encyclopedia of Database Systems.

Editorial

Lila Kari, 2021, Theor. Comput. Sci..

Involution Solid and Join codes

Lila Kari, Kalpana Mahalingam, Natasa Jonoska, 2008, Fundam. Informaticae.

Pseudopower Avoidance

Zhi Xu, Lila Kari, Ehsan Chiniforooshan, 2012, Fundam. Informaticae.

Reversible Molecular Computation in Ciliates

Jarkko Kari, Lila Kari, Laura F. Landweber, 1999, Jewels are Forever.

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1993, MFCS.

Frontiers in Computational Neuroscience

Lila Kari, Eugen Czeizler, 2022 .

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1993, Theor. Comput. Sci..

How to Compute with DNA

Rani Siromoney, Mark Daley, Lila Kari, 1999, FSTTCS.

Universal Molecular Computation in Ciliates

Lila Kari, Laura F. Landweber, L. Landweber, 2002 .

Parallel Communicating Systems

Lila Kari, L. Kari, 1990, Bull. EATCS.

State complexity of union and intersection of square and reversal on k regular languages

Yuan Gao, Lila Kari, Sheng Yu, 2012, Theor. Comput. Sci..

L Systems

Grzegorz Rozenberg, Lila Kari, Arto Salomaa, 1974, Handbook of Formal Languages.

Preventing Undesirable Bonds Between DNA Codewords

Lila Kari, Stavros Konstantinidis, Petr Sosík, 2004, DNA.

On Insertion and Deletion in Formal Languages

Lila Kari, L. Kari, 1991 .

Aperiodic Languages and Generalizations

Lila Kari, Gabriel Thierrin, L. Kari, 1994, Mathematical Aspects of Natural and Formal Languages.

On the Universality of P Systems with Minimal Symport/Antiport Rules

Andrei Paun, Carlos Martín-Vide, Lila Kari, 2004, Aspects of Molecular Computing.

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)

Maxime Crochemore, Lila Kari, Mehryar Mohri, 2011, Dagstuhl Reports.

An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words

Lila Kari, Shinnosuke Seki, Eugen Czeizler, 2009, Developments in Language Theory.

State Complexity of Catenation Combined with Union and Intersection

Yuan Gao, Lila Kari, Sheng Yu, 2010, CIAA.

Finite-state error/edit-systems and difference-measures for languages and words

Lila Kari, Stavros Konstantinidis, Jennifer Jie Xu, 2003 .

Generalized Derivatives

Lila Kari, L. Kari, 1993, Fundam. Informaticae.

Twin-roots of words and their properties

Lila Kari, Shinnosuke Seki, Kalpana Mahalingam, 2009, Theor. Comput. Sci..

Hypergraph Automata: a Theoretical Model for patterned Self-assembly

Lila Kari, Steffen Kopecki, Amirhossein Simjour, 2014, Int. J. Found. Comput. Sci..

Polyominoes simulating arbitrary-neighborhood zippers and tilings pdf

Lila Kari, Benoît Masson, 2011, Theor. Comput. Sci..

On Parallel Deletions Applied to a Word

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, RAIRO Theor. Informatics Appl..

DNA Computing Based on Splicing: The Existence of Universal Computers

Rudolf Freund, Gheorghe Paun, Lila Kari, 1999, Theory of Computing Systems.

Subapical Bracketed L-Systems

Przemyslaw Prusinkiewicz, Lila Kari, 1994, TAGT.

Computational power of gene rearrangement

Lila Kari, Laura F. Landweber, 1999, DNA Based Computers.

Negative Interactions in Irreversible Self-assembly

Lila Kari, Benoît Masson, David Doty, 2010, DNA.

MoDMaps3D: an interactive webtool for the quantification and 3D visualization of interrelationships in a dataset of DNA sequences

Lila Kari, Rallis Karamichalis, 2017, Bioinform..

Closure and decidability properties of some language classes with respect to ciliate bio-operations

Oscar H. Ibarra, Mark Daley, Lila Kari, 2003, Theor. Comput. Sci..

Duplication in DNA Sequences

Lila Kari, Shinnosuke Seki, Zachary Kincaid, 2008, Developments in Language Theory.

Context-free recombinations

Jarkko Kari, Lila Kari, 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

Static and dynamic properties of DNA languages

Lila Kari, Stavros Konstantinidis, 2003, Proceedings of the 25th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (IEEE Cat. No.03CH37439).

DNA Computing and Errors: A Computer Science Perspective

Lila Kari, Petr Sosík, Elena Losseva, 2005 .

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems

Gheorghe Paun, Lila Kari, Sheng Yu, 1997, DNA Based Computers.

One-Reversal Counter Machines and Multihead Automata: Revisited

Oscar H. Ibarra, Mark Daley, Lila Kari, 2011, SOFSEM.

Results on Transforming NFA into DFCA

Andrei Paun, Lila Kari, Cezar Câmpeanu, 2005, Fundam. Informaticae.

Word Blending in Formal Languages

Zihao Wang, Lila Kari, Timothy Ng, 2020, Fundam. Informaticae.

Conjugate word blending: formal model and experimental implementation by XPCR

Lila Kari, Timothy Ng, Giuditta Franco, 2021, Natural Computing.