• Analysing complexity in classes of unary automatic structures

      Liu, J; Minnes, M (Springer Berlin / Heidelberg, 2009)
      This paper addresses the time complexity of several queries (including membership and isomorphism) in classes of unary automatic structures and the state complexity of describing these classes. We focus on unary automatic ...
    • Deciding the isomorphism problem in classes of unary automatic structures

      Liu, JL; Minnes, M (Elsevier, 2011)
      We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic equivalence relations, unary automatic linear orders, and unary automatic trees. That is, we provide algorithms which ...
    • Unary automatic graphs: an algorithmic approach

      Khoussainov, B; Liu, J; Minnes, M (Cambridge University Press, 2009)
      This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced using such operations are of finite degree and automatic over the unary alphabet (that is, they can ...
    • Unary automatic graphs: an algorithmic perspective

      Khoussainov, B; Liu, J; Minnes, M (Springer-Verlag Berlin, Heidelberg, 2008)
      This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and can be described by finite automata over the unary alphabet. ...