Author of the publication

A common algebraic description for probabilistic and quantum computations, .

, , and . Theor. Comput. Sci., 345 (2-3): 206-234 (2005)

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

Finite Moniods: From Word to Circuit Evaluation., , , and . SIAM J. Comput., 26 (1): 138-152 (1997)Characterization of Idempotent Transformation Monoids.. Inf. Process. Lett., 31 (3): 163-166 (1989)Algebraic Results on Quantum Automata., , , , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 93-104. Springer, (2004)Faithful Loops for Aperiodic E-Ordered Monoids., and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 55-66. Springer, (2009)Membership Testing in Commutative Transformation Semigroups. Inf. Comput., 79 (1): 84-93 (October 1988)Proving that a Tree Language is not First-Order Definable.. CoRR, (2018)Testing Membership in Commutative Transformation Semigroups.. ICALP, volume 267 of Lecture Notes in Computer Science, page 542-549. Springer, (1987)Star-Free Open Languages and Aperiodic Loops., , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 87-98. Springer, (2001)Testing Membership: Beyond Permutation Groups (Extended Abstract)., , and . STACS, volume 349 of Lecture Notes in Computer Science, page 388-399. Springer, (1989)Conservative groupoids recognize only regular languages., , , , and . Inf. Comput., (2014)