36 citations · 111 across the 22 of their papers we have counts for
4 papers · 1 filter
Almost free algebras: from the word problem to elimination of quantifiers
Yifan Jia, Heer Tern Koh, Bakh Khoussainov
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term eq…
Three Lectures on Automatic Structures
Bakhadyr Khoussainov, Mia Minnes
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related t…
Model Theoretic Complexity of Automatic Structures
Bakhadyr Khoussainov, Mia Minnes
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks o…
Unary Automatic Graphs: An Algorithmic Perspective
Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes
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 automatic over…