3818 search results - page 205 / 764 » Word Problems on Compressed Words |
175
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
155
click to vote
INDOCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
153
click to vote
FC
2001
Springer
15 years 11 months ago
2001
Springer
This article addresses a problem with copy-protecting a large collection of electronic content. The notion and severity of a generic attack are raised in the context of Adams and Z...
180
click to vote
FROCOS
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
197
click to vote
COMPSYSTECH
2007
15 years 8 months ago
2007
: The paper is dedicated to plagiarism problem. The ways how to reduce plagiarism: both: plagiarism prevention and plagiarism detection are discussed. Widely used plagiarism detect...