- Scholarly Commons Home
- →
- AUT University Research
- →
- School of Computing and Mathematical Sciences
- →
- Search
JavaScript is disabled for your browser. Some features of this site may not work without it.
Search
Search Results for Collection: School of Computing and Mathematical Sciences
-
(AUT University, 4th International Joint Conference on Automated Reasoning (IJCAR 2008); 2008)In this paper we present our work in progress towards obtaining a Nelson-Oppen style combination for combining quantified theories, where each individual component theory admits quantifier elimination. We introduces the ... -
(Springer, AUT University; 2009)Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the ... -
(Australian Computer Society (ACS), AUT University; 2012)We study the computational complexity of solving the following problem: Given a game G played on a fi- nite directed graph G, output all nodes in G from which a specific player wins the game G. We pro- vide algorithms for ... -
(AUT University, Springer Berlin / Heidelberg; 2010)The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height is at least as hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, ... -
(Springer Berlin / Heidelberg, AUT University; 2011)This paper investigates algorithms for extracting winning strategies in two-player games played on nite graphs. We focus on a special class of games called update games. We present a procedure for extracting winning ... -
(AUT University, 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. ... -
(Springer Berlin / Heidelberg, AUT University; 2009)Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the ... -
(Combridge University Press, AUT University, Cambridge University Press, New York, NY, USA; 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 ... -
(Springer Berlin / Heidelberg, AUT University; 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 ... -
(Springer Berlin / Heidelberg, AUT University; 2007)In this paper we initiate the study of Ehrenfeucht-Fraïssé games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and ...