1399 search results - page 36 / 280 » Multi-party Finite Computations |
AAAI
2008
14 years 6 days ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
BSL
2005
13 years 9 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
BIRTHDAY
2004
Springer
14 years 3 months ago
2004
Springer
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
ANTS
2006
Springer
14 years 1 months ago
2006
Springer
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...