205 search results - page 14 / 41 » Testing the Equivalence of Regular Languages |
133
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
128
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
85
Voted
ICALP
1999
Springer
15 years 6 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
123
click to vote
CCS
1998
ACM
15 years 6 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
135
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....