3818 search results - page 555 / 764 » Word Problems on Compressed Words |
178
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
174
click to vote
BVAI
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
160
click to vote
COLCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract. Malicious Web content poses a serious threat to the Internet, organizations and users. Current approaches to detecting malicious Web content employ high-powered honey cli...
161
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
186
click to vote
CSSE
2008
IEEE
15 years 8 months ago
2008
IEEE
: The traditional transportation information inquiry mainly uses key words based on the text, and the service the inquiry system provided is onefold and only aims at one transporti...