513 search results - page 43 / 103 » Finitely Based, Finite Sets of Words |
174
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
146
click to vote
ISCIS
2009
Springer
16 years 23 days ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
174
click to vote
FOIKS
2008
Springer
15 years 7 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
135
click to vote
JACIII
2008
15 years 6 months ago
2008
Abstract. In this paper we introduce a multi-stage decision making procedure where decision makers' opinions are weighted by their contribution to the agreement after they sor...
157
click to vote
MST
2008
15 years 6 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...