SYSTOLIC TREE WITH BASE AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 221, doi. 10.1142/S0129054191000145
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 1991 AND VI 2 AND IP 3
Results: 6
1
2
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 207, doi. 10.1142/S0129054191000133
- By:
- Publication type:
- Article
3
ON THE LIMITATIONS OF LOCALLY ROBUST POSITIVE REDUCTIONS.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 237, doi. 10.1142/S0129054191000157
- By:
- Publication type:
- Article
4
EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 183, doi. 10.1142/S0129054191000121
- By:
- Publication type:
- Article
5
ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 257, doi. 10.1142/S0129054191000169
- By:
- Publication type:
- Article
6
PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES.
- Published in:
- International Journal of Foundations of Computer Science, 1991, v. 2, n. 3, p. 267, doi. 10.1142/S0129054191000170
- By:
- Publication type:
- Article