Lila Kari

According to our database1, Lila Kari
  • authored at least 193 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Editorial.
Theor. Comput. Sci., 2017

Editorial.
Theor. Comput. Sci., 2017

On the overlap assembly of strings and languages.
Natural Computing, 2017

Deciding whether a regular language is generated by a splicing system.
J. Comput. Syst. Sci., 2017

Further remarks on DNA overlap assembly.
Inf. Comput., 2017

Binary Pattern Tile Set Synthesis Is NP-Hard.
Algorithmica, 2017

Disjunctivity and other properties of sets of pseudo-bordered words.
Acta Inf., 2017

2016
Editorial.
Theor. Comput. Sci., 2016

Editorial.
Theor. Comput. Sci., 2016

Editorial.
Theor. Comput. Sci., 2016

Editorial.
Theor. Comput. Sci., 2016

Preface.
Natural Computing, 2016

Additive methods for genomic signatures.
BMC Bioinformatics, 2016

2015
Editorial.
Theor. Comput. Sci., 2015

Editorial.
Theor. Comput. Sci., 2015

Editorial.
Theor. Comput. Sci., 2015

TCS in the 21st century.
Theor. Comput. Sci., 2015

3-color bounded patterned self-assembly.
Natural Computing, 2015

A Formal Language Model of DNA Polymerase Enzymatic Activity.
Fundam. Inform., 2015

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems.
CoRR, 2015

An investigation into inter- and intragenomic variations of graphic genomic signatures.
BMC Bioinformatics, 2015

Methods for Relativizing Properties of Codes.
Acta Cybern., 2015

Binary Pattern Tile Set Synthesis Is NP-hard.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
On the maximality of languages with combined types of code properties.
Theor. Comput. Sci., 2014

Generating the Pseudo-Powers of a Word.
Journal of Automata, Languages and Combinatorics, 2014

Hypergraph Automata: a Theoretical Model for patterned Self-assembly.
Int. J. Found. Comput. Sci., 2014

Binary pattern tile set synthesis is NP-hard.
CoRR, 2014

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers.
CoRR, 2014

Pseudo-Identities and Bordered Words.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
The Power of Nondeterminism in Self-Assembly.
Theory of Computing, 2013

State complexity of star of union and square of union on k regular languages.
Theor. Comput. Sci., 2013

Hypergraph Automata: A Theoretical Model for Patterned Self-assembly
CoRR, 2013

3-color Bounded Patterned Self-assembly.
CoRR, 2013

Map of Life: Measuring and Visualizing Species' Relatedness with "Molecular Distance Maps".
CoRR, 2013

Negative Interactions in Irreversible Self-assembly.
Algorithmica, 2013

Hypergraph Automata: A Theoretical Model for Patterned Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2013

3-Color Bounded Patterned Self-assembly - (Extended Abstract).
Proceedings of the DNA Computing and Molecular Programming - 19th International Conference, 2013

Negative Glues and Non-determinism in Nanocomputations by Self-assembly.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
DNA Computing - Foundations and Implications.
Proceedings of the Handbook of Natural Computing, 2012

State complexity of union and intersection of square and reversal on k regular languages.
Theor. Comput. Sci., 2012

State complexity of union and intersection of star on k regular languages.
Theor. Comput. Sci., 2012

Relativized codes.
Theor. Comput. Sci., 2012

State complexity of combined operations with two basic operations.
Theor. Comput. Sci., 2012

One-reversal counter machines and multihead automata: Revisited.
Theor. Comput. Sci., 2012

De Bruijn Sequences Revisited.
Int. J. Found. Comput. Sci., 2012

State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal.
Int. J. Found. Comput. Sci., 2012

Pseudopower Avoidance.
Fundam. Inform., 2012

Iterated Hairpin Completions of Non-crossing Words.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Deciding Whether a Regular Language Is Generated by a Splicing System.
Proceedings of the DNA Computing and Molecular Programming - 18th International Conference, 2012

State Complexity of Star and Square of Union of k Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Triangular and Hexagonal Tile Self-assembly Systems.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Polyominoes simulating arbitrary-neighborhood zippers and tilings.
Theor. Comput. Sci., 2011

Block insertion and deletion on trajectories.
Theor. Comput. Sci., 2011

Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies.
Natural Computing, 2011

Schema for Parallel Insertion and Deletion: Revisited.
Int. J. Found. Comput. Sci., 2011

Properties of Pseudo-Primitive Words and their Applications.
Int. J. Found. Comput. Sci., 2011

Orthogonal Shuffle on Trajectories.
Int. J. Found. Comput. Sci., 2011

State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection.
Int. J. Found. Comput. Sci., 2011

An extension of the Lyndon-Schützenberger result to pseudoperiodic words.
Inf. Comput., 2011

On the Regularity of Iterated Hairpin Completion of a Single Word.
Fundam. Inform., 2011

K-Comma Codes and Their Generalizations.
Fundam. Inform., 2011

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).
Dagstuhl Reports, 2011

Deciding if a Regular Language is Generated by a Splicing System
CoRR, 2011

Iterated Hairpin Completions of Non-crossing Words
CoRR, 2011

On the regularity of iterated hairpin completion of a single word
CoRR, 2011

One-Reversal Counter Machines and Multihead Automata: Revisited.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

The Power of Nondeterminism in Self-Assembly.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

De Bruijn Sequences Revisited.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
On a special class of primitive words.
Theor. Comput. Sci., 2010

Watson-Crick palindromes in DNA computing.
Natural Computing, 2010

An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality.
Fundam. Inform., 2010

The Power of Nondeterminism in Self-Assembly.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Ciliate Gene Unscrambling with Fewer Templates
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

State Complexity of Catenation Combined with Star and Reversal
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

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

The Power of Nondeterminism in Self-Assembly
CoRR, 2010

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement
CoRR, 2010

Triangular Self-Assembly
CoRR, 2010

Properties of Pseudo-Primitive Words and their Applications
CoRR, 2010

Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
CoRR, 2010

Negative Interactions in Irreversible Self-Assembly
CoRR, 2010

State Complexity of Catenation Combined with Union and Intersection.
Proceedings of the Implementation and Application of Automata, 2010

Triangular Tile Self-assembly Systems.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Negative Interactions in Irreversible Self-assembly.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Schema for Parallel Insertion and Deletion.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

DNA Computing and Its Implications for Theoretical Computer Science.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Pseudo-power Avoidance.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Twin-roots of words and their properties.
Theor. Comput. Sci., 2009

On the descriptional complexity of Watson-Crick automata.
Theor. Comput. Sci., 2009

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.
SIAM J. Comput., 2009

On pseudoknot-bordered words and their properties.
J. Comput. Syst. Sci., 2009

Geometrical tile design for complex neighborhoods.
Front. Comput. Neurosci., 2009

Pseudo-Power Avoidance
CoRR, 2009

An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
On the weight of universal insertion grammars.
Theor. Comput. Sci., 2008

Watson-Crick Bordered Words and their Syntactic Monoid.
Int. J. Found. Comput. Sci., 2008

Involution Solid and Join codes.
Fundam. Inform., 2008

The many facets of natural computing.
Commun. ACM, 2008

On a Special Class of Primitive Words.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Duplication in DNA Sequences.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Watson-Crick automata: determinism and state complexity.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
Involutively Bordered Words.
Int. J. Found. Comput. Sci., 2007

The syntactic monoid of hairpin-free languages.
Acta Inf., 2007

Nanocomputing by Self-assembly.
Proceedings of the Unconventional Computation, 6th International Conference, 2007

Watson-Crick Conjugate and Commutative Words.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
A Formal Language Analysis of DNA Hairpin Structures.
Fundam. Inform., 2006

Block Substitutions and Their Properties.
Fundam. Inform., 2006

Involution Solid Codes.
Proceedings of the Nanotechnology: Science and Computation, 2006

DNA Codes and Their Properties.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

Involution Solid and Join Codes.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Aspects of shuffle and deletion on trajectories.
Theor. Comput. Sci., 2005

On properties of bond-free DNA languages.
Theor. Comput. Sci., 2005

Computationally universal P systems without priorities: two catalysts are sufficient.
Theor. Comput. Sci., 2005

Language equations, maximality and error-detection.
J. Comput. Syst. Sci., 2005

Bond-free languages: formalizations, maximality and construction methods.
Int. J. Found. Comput. Sci., 2005

Operations on trajectories with applications to coding and bioinformatics.
Int. J. Found. Comput. Sci., 2005

Results on Transforming NFA into DFCA.
Fundam. Inform., 2005

Who Counts Your Votes?
Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce, and e-Services (EEE 2005), 29 March, 2005

Hairpin Structures in DNA Words.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

On Weight of Universal Insertion Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Families of languages defined by ciliate bio-operations.
Theor. Comput. Sci., 2004

Descriptional Complexity of Error/Edit Systems.
Journal of Automata, Languages and Combinatorics, 2004

On Language Equations with Deletion.
Bulletin of the EATCS, 2004

Substitutions, Trajectories and Noisy Channels.
Proceedings of the Implementation and Application of Automata, 2004

Preventing Undesirable Bonds Between DNA Codewords.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Bond-Free Languages: Formalizations, Maximality and Construction Methods.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

On the Universality of P Systems with Minimal Symport/Antiport Rules.
Proceedings of the Aspects of Molecular Computing, 2004

Substitution on Trajectories.
Proceedings of the Theory Is Forever, 2004

2003
Coding properties of DNA languages.
Theor. Comput. Sci., 2003

Closure and decidability properties of some language classes with respect to ciliate bio-operations.
Theor. Comput. Sci., 2003

The ld and dlad Bio-Operations on Formal Languages.
Journal of Automata, Languages and Combinatorics, 2003

Sticky-free and overhang-free DNA languages.
Acta Inf., 2003

2002
On the Decidability of Self-Assembly of Infinite Ribbons.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Some Properties of Ciliate Bio-operations.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Descriptional Complexity of Error/Edit Systems.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

Codes, Involutions, and DNA Encodings.
Proceedings of the Formal and Natural Computing, 2002

2001
A computer scientist's guide to molecular biology.
Soft Comput., 2001

Morphisms preserving densities.
Int. J. Comput. Math., 2001

DNA computing in vitro and in vivo.
Future Generation Comp. Syst., 2001

Coding Properties of DNA Languages.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation.
Proceedings of the Words, Semigroups, and Transductions, 2001

Context-free recombinations.
Proceedings of the Where Mathematics, 2001

DNA Computers: Tomorrow's Reality.
Current Trends in Theoretical Computer Science, 2001

2000
Using DNA to solve the Bounded Post Correspondence Problem.
Theor. Comput. Sci., 2000

Shuffle and scattered deletion closure of languages.
Theor. Comput. Sci., 2000

Half century of automata theory.
SIGACT News, 2000

1999
DNA Computing Based on Splicing: The Existence of Universal Computers.
Theory Comput. Syst., 1999

Towards a DNA Solution to the Shortest Common Superstring Problem.
International Journal on Artificial Intelligence Tools, 1999

Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Bringing PC Grammar Systems Closer to Hoare's CSPs.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

How to Compute with DNA.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Computational power of gene rearrangement.
Proceedings of the DNA Based Computers, 1999

Reversible Molecular Computation in Ciliates.
Proceedings of the Jewels are Forever, 1999

1998
DNA Computing, Sticker Systems, and Universality.
Acta Inf., 1998

Using DNA to solve the Bounded Post Correspondence Problem.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Insertion and Deletion Closure of Languages.
Theor. Comput. Sci., 1997

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.
Proceedings of the DNA Based Computers, 1997

From Micro-Soft to Bio-Soft: Computing With DNA.
Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996
The Power of Restricted Splicing with Rules from a Regular Language.
J. UCS, 1996

Maximal and Minimal Solutions to Language Equations.
J. Comput. Syst. Sci., 1996

Omega-Syntactic Congruences.
Journal of Automata, Languages and Combinatorics, 1996

Contextual Insertions/Deletions and Computability.
Inf. Comput., 1996

Two Lower Bounds on Distributive Generation of Languages.
Fundam. Inform., 1996

Test Tube Distributed Systems Based on Splicing.
Computers and Artificial Intelligence, 1996

1995
Multi-Pattern Languages.
Theor. Comput. Sci., 1995

Teams in cooperating grammar systems.
J. Exp. Theor. Artif. Intell., 1995

On Parallel Deletions Applied to a Word.
ITA, 1995

Generalised DOL Trees.
Acta Cybern., 1995

Morphisms and Associated Congruences.
Proceedings of the Developments in Language Theory II, 1995

1994
On Language Equations with Invertible Operations.
Theor. Comput. Sci., 1994

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Theor. Comput. Sci., 1994

Subapical Bracketed L-Systems.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Two Lower Bounds on Distributive Generation of Languages.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Power of Controlled Insertion and Deletion.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Parallel Communicating Grammar Systems.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

In the prehistory of formal language theory: Gauss languages.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Deletion Sets.
Fundam. Inform., 1993

Generalized Derivatives.
Fundam. Inform., 1993

Insertion operations: Closure properties.
Bulletin of the EATCS, 1993

Gramars with Oracles.
Sci. Ann. Cuza Univ., 1993

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
The Impact of the Number of Cooperating Grammars on the Generative Power.
Theor. Comput. Sci., 1992

In the prehistory of formal language theory: Gauss Languages.
Bulletin of the EATCS, 1992

Insertion and Deletion of Words: Determinism and Reversibility.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
Secret ballot elections in computer networks.
Computers & Security, 1991

1990
On a theorem of Günter Asser.
Math. Log. Q., 1990

Parallel Communicating Systems.
Bulletin of the EATCS, 1990

Secret Selling of Secrets with Several Buyers.
Bulletin of the EATCS, 1990

A Hierarchy of Unary Primitive Recursive String-Functions.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990


  Loading...