( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection.

, , , и . Int. J. Found. Comput. Sci., 22 (8): 1797-1812 (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.

Lila Fanihagh

Lila Khadembashi

Arne Liland

Kari Niemi

Kari Kopperi

 

Другие публикации лиц с тем же именем

State Complexity of Star and Square of Union of k Regular Languages., и . DCFS, том 7386 из Lecture Notes in Computer Science, стр. 155-168. Springer, (2012)Computationally universal P systems without priorities: two catalysts are sufficient., , , и . Theor. Comput. Sci., 330 (2): 251-266 (2005)The Power of Nondeterminism in Self-Assembly., , , , и . SODA, стр. 590-602. SIAM, (2011)Reversible Molecular Computation in Ciliates., , и . Jewels are Forever, стр. 353-363. Springer, (1999)In the prehistory of formal language theory: Gauss languages., , , и . Current Trends in Theoretical Computer Science, том 40 из World Scientific Series in Computer Science, World Scientific, (1993)Pseudo-Identities and Bordered Words., и . Discrete Mathematics and Computer Science, стр. 207-222. The Publishing House of the Romanian Academy, (2014)State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal., , , и . Int. J. Found. Comput. Sci., 23 (1): 51-66 (2012)String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation., и . Words, Semigroups, and Transductions, стр. 275-287. World Scientific, (2001)K-Comma Codes and Their Generalizations., , и . Fundam. Informaticae, 107 (1): 1-18 (2011)Computational power of gene rearrangement., и . DNA Based Computers, том 54 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 207-216. DIMACS/AMS, (1999)