COMPLETUDE D'UN SYSTEME FORMEL POUR PROUVER L'EQUIVALENCE DE CERTAINS SCHEMAS RECURSIFS MONADIQUES.COURCELLE B; VUILLEMIN J.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 63; PP. 1-19; ABS. ANGL.; BIBL. 8 REF.Article

LANGAGES D'INTERPRETATION DES SCHEMAS RECURSIFS.COUSINEAU FG; RIFFLET JM.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 1; PP. 21-42; BIBL. 3 REF.Article

EQUIVALENCE PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGES AND MONADIC RECURSION SCHEMES.FRIEDMAN EP.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 3; PP. 344-359; BIBL. 8 REF.Article

A THEORY OF COMPLEXITY OF MONADIC RECURSION SCHEMESDIKOVSKII AJ.1981; R.A.I.R.O.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 1; PP. 67-94; ABS. FRE; BIBL. 14 REF.Article

Rewriting queries using views over monadic database schemasVAN DEN BUSSCHE, Jan.Information processing letters. 2001, Vol 79, Num 3, pp 111-114, issn 0020-0190Article