8699 search results - page 314 / 1740 » Elements of the Theory of Computation |
209
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
188
click to vote
LICS
2006
IEEE
16 years 23 days ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
190
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
179
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
152
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...