2018 search results - page 167 / 404 » Code Normal Forms |
117
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
110
Voted
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
102
Voted
SAT
2005
Springer
15 years 8 months ago
2005
Springer
Conjunctive Normal Form (CNF) Boolean formulas generated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simpl...
94
Voted
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Prior work on computing queries from materialized views has focused on views defined by expressions consisting of selection, projection, and inner joins, with an optional aggrega...
106
Voted
WCC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...