Sciweavers

1449 search results - page 37 / 290
» Finiteness results for sigmoidal
Sort
View
IPL
2007
94views more  IPL 2007»
14 years 11 months ago
A note on emptiness for alternating finite automata with a one-letter alphabet
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
Petr Jancar, Zdenek Sawa
FFA
2010
84views more  FFA 2010»
14 years 10 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
ENTCS
2006
103views more  ENTCS 2006»
14 years 12 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
GI
2010
Springer
14 years 9 months ago
Finite System Composition and Interaction
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
Johannes Reich
ICCS
2003
Springer
15 years 5 months ago
Finite Element Simulation of Stress Evolution in a Frictional Contact System
A 3-dimensional finite element algorithm for modeling nonlinear frictional contact behaviours between deformable bodies with the node-to-point contact element strategy has been pro...
H. L. Xing, Peter Mora, Akifumi Makinouchi