University of Hertfordshire

• The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)graphs

  Horváth, G., Nehaniv, C. & Podoski, K., 30 Nov 2017, In: International Journal of Algebra and Computation. 27, 7, p. 863-886 24 p.

  Research output: Contribution to journal › Article › peer-review

• On Algebras with many symmetric operations

  Carvalho, C. & Krokhin, A., 1 Aug 2016, In: International Journal of Algebra and Computation. 26, 5

  Research output: Contribution to journal › Article › peer-review

• Asynchronous automata networks can emulate any synchronous automata network

  Nehaniv, C. L., 2004, In: International Journal of Algebra and Computation. 14, 5-6, p. 719-739

  Research output: Contribution to journal › Article › peer-review

View all »