371 search results - page 44 / 75 » Partition Theorems and Computability Theory |
61
Voted
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
FCT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
BIRTHDAY
1997
Springer
15 years 1 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...