Spinal-Formed Context-Free Tree Grammars.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 59, doi. 10.1007/s002249910004
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2000 AND VI 33 AND IP 1
Results: 7
1
2
Erratum Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices.
- Published in:
- 2000
- By:
- Publication type:
- Correction Notice
3
An Efficient Algorithm for Generating Prufer Codes from Labelled Trees.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 97, doi. 10.1007/s002249910006
- By:
- Publication type:
- Article
4
The Characterization of Data-Accumulating Algorithms.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 85, doi. 10.1007/s002249910005
- By:
- Publication type:
- Article
5
Team Learning of Computable Languages.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 35, doi. 10.1007/s002249910003
- By:
- Publication type:
- Article
6
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 17
- By:
- Publication type:
- Article
7
On Approximation Scheme Preserving Reducibility and Its Applications.
- Published in:
- Theory of Computing Systems, 2000, v. 33, n. 1, p. 1, doi. 10.1007/s002249910001
- By:
- Publication type:
- Article