Alain Colmerauer
- 1 COLMERAUER, A. Pr6c6dence, analyse syntaxique et langages de programmation. Thesis, U. de Grenoble, Grenoble, France, Sept. 1967.Google Scholar
- 2 FLOYD, R.W. Syntactic analysis and operator precedence. J.ACM I0, 3 (July 1963), 316-333. Google ScholarDigital Library
- 3 GINSBURG, S., AND GREIBACH, S. 1)eterministic context-free languages. Inform. Contr. 9 (Dec. 1966), 620-648.Google ScholarCross Ref
- 4 GRIFFITHS, T. V., AND PETRICR, S.R. O11 the relative efficiencies of context-free grammar recognizers. Comm. ACM 8, 5 (May 1965), 289-300. Google ScholarDigital Library
- 5 PAIR, C. Arbres, piles et compilation. Rev. Franc. Trait. Inf. 7, 3 (1964), 199-216.Google Scholar
- 6 WARSHALL, S. A theorem on Boolean matrices. J.ACM 9, 1 (Jan. 1962), 11-12. Google ScholarDigital Library
- 7 WIRTH, N., AND WEBER, H. EULER: A generalization of ALGOL, and its formal definition: part I. Comm. ACM 9, 1 (Jan. 1966), 13-23, 25. Google ScholarDigital Library
- 8 NAUR, P., ET AL (Eds.). Report on the algorithmic language ALGOL 60. Comm. ACM 3, 5 (May 1960), 299-314. Google Scholar
Index Terms
- Total Precedence Relations
Recommendations
Hyperclones Determined by Total-Parts of Hyper-relations
ISMVL '09: Proceedings of the 2009 39th International Symposium on Multiple-Valued LogicThis paper studies sets of hyper-operations preserving relations on power set without emptyset. For a particular property of a relation, such a set is hyperclone. We consider relations having total part exactly from Rosenberg's classes of relations. By ...
Rough relations, neighborhood relations, and granular computing
RSKT'11: Proceedings of the 6th international conference on Rough sets and knowledge technologyBased on formal relationships in Pansystems, this paper discusses the notion of indistinguishability relations among some order pairs in a binary relation and introduces rough relations. A rough relation is a generalization of a rough set from a new ...
About the fundamental relations defined on the hypergroupoids associated with binary relations
This paper deals with connections between hypergroupoids and n-ary relations. First we prove that the study of the reduced hypergroupoids associated with n-ary relations can be linked to the simpler case of binary relations. On the basis of the ...
Comments