MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY.
- Published in:
- International Journal of Foundations of Computer Science, 1998, v. 9, n. 3, p. 315, doi. 10.1142/S0129054198000209
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 1998 AND VI 9 AND IP 3
Results: 5
1
2
LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY.
- Published in:
- International Journal of Foundations of Computer Science, 1998, v. 9, n. 3, p. 277, doi. 10.1142/S0129054198000180
- By:
- Publication type:
- Article
3
RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 1998, v. 9, n. 3, p. 295, doi. 10.1142/S0129054198000192
- By:
- Publication type:
- Article
4
NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS.
- Published in:
- International Journal of Foundations of Computer Science, 1998, v. 9, n. 3, p. 249, doi. 10.1142/S0129054198000179
- By:
- Publication type:
- Article
5
THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES.
- Published in:
- International Journal of Foundations of Computer Science, 1998, v. 9, n. 3, p. 321, doi. 10.1142/S0129054198000210
- By:
- Publication type:
- Article