( en | de | ru )

 

Disambiguation of "Kari, Lila"

Author of the publication

copydeleteadd this publication to your clipboard
De Bruijn Sequences Revisited.

, and . AFL, page 241-254. (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lila Fanihagh

Lila Khadembashi

Arne Liland

Kari Niemi

Kari Kopperi

 

Other publications of authors with the same name

Insertion and Deletion of Words: Determinism and Reversibility.. MFCS, volume 629 of Lecture Notes in Computer Science, page 315-326. Springer, (1992)State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal., , , and . Int. J. Found. Comput. Sci., 23 (1): 51-66 (2012)String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation., and . Words, Semigroups, and Transductions, page 275-287. World Scientific, (2001)Computational power of gene rearrangement., and . DNA Based Computers, volume 54 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 207-216. DIMACS/AMS, (1999)Reversible Molecular Computation in Ciliates., , and . Jewels are Forever, page 353-363. Springer, (1999)State Complexity of Star and Square of Union of k Regular Languages., and . DCFS, volume 7386 of Lecture Notes in Computer Science, page 155-168. Springer, (2012)K-Comma Codes and Their Generalizations., , and . Fundam. Informaticae, 107 (1): 1-18 (2011)Computationally universal P systems without priorities: two catalysts are sufficient., , , and . Theor. Comput. Sci., 330 (2): 251-266 (2005)The Power of Nondeterminism in Self-Assembly., , , , and . SODA, page 590-602. SIAM, (2011)Bond-Free Languages: Formalizations, Maximality and Construction Methods, , and . DNA Computing, (2005)