1146 search results - page 122 / 230 » Finite cupping sets |
CSL
2008
Springer
14 years 7 hour ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
FPL
2008
Springer
13 years 11 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
FORTE
2004
13 years 11 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
NC
1998
13 years 11 months ago
1998
This paper reports the results of experiments in complex Arabic phonetic features identification using a rulebased system (SARPH) and modular connectionist architectures. The firs...
JSAC
2008
13 years 10 months ago
2008
Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node val...