1449 search results - page 28 / 290 » Finiteness results for sigmoidal |
CIE
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
110
click to vote
ICGI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
EH
1999
IEEE
1999
IEEE
Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences
15 years 4 months ago
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the c...
HYBRID
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...