Author of the publication

State and Transition Complexity of Watson-Crick Finite Automata.

, and . FCT, volume 1684 of Lecture Notes in Computer Science, page 409-420. Springer, (1999)

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.

 

Other publications of authors with the same name

The Power of Communication: P Systems with Symport/Antiport., and . New Generation Comput., 20 (3): 295-306 (2002)Hopcroft's Minimization Technique: Queues or Stacks?., , and . CIAA, volume 5148 of Lecture Notes in Computer Science, page 78-91. Springer, (2008)On the Universality of P Systems with Minimal Symport/Antiport Rules., , and . Aspects of Molecular Computing, volume 2950 of Lecture Notes in Computer Science, page 254-265. Springer, (2004)Tight Bounds for the State Complexity of Deterministic Cover Automata., , and . DCFS, page 223-231. New Mexico State University, Las Cruces, New Mexico, USA, (2006)Special issue on Foundational Methods in Systems Biology., and . Theor. Comput. Sci., (2024)Gemmating P Systems are Computationally Complete with Four Membranes., , and . DCFS, Report No. 619, page 191-203. Department of Computer Science, The University of Western Ontario, Canada, (2004)On Flip-Flop Membrane Systems with Proteins., and . Workshop on Membrane Computing, volume 4860 of Lecture Notes in Computer Science, page 414-427. Springer, (2007)State and Transition Complexity of Watson-Crick Finite Automata., and . FCT, volume 1684 of Lecture Notes in Computer Science, page 409-420. Springer, (1999)Unexpected universality results for three classes of P systems with symport/antiport., , , and . Nat. Comput., 2 (4): 337-348 (2003)Universal enzymatic numerical P systems with small number of enzymatic variables., , , and . Sci. China Inf. Sci., 61 (9): 092103:1-092103:12 (2018)