Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 3, p. 193, doi. 10.1007/s002240011006
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2001 AND VI 34 AND IP 3
Results: 4
1
2
An Improved Stability Bound for Binary Exponential Backoff.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 3, p. 229, doi. 10.1007/s002240011005
- By:
- Publication type:
- Article
3
Distributionally Hard Languages.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 3, p. 245, doi. 10.1007/s002240011003
- By:
- Publication type:
- Article
4
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 3, p. 263, doi. 10.1007/s002240011001
- By:
- Publication type:
- Article