Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALGEBRAIC LANGUAGE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 312

  • Page / 13
Export

Selection :

  • and

PROPRIETES COMBINATOIRES DES LANGAGES STANDARD.BEAUQUIER J.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 23-29; ABS. ANGL.; BIBL. 7 REF.Conference Paper

MONOIDES SYNTACTIQUES ET LANGAGES ALGEBRIQUES.SAKAROVITCH J.1976; ; S.L.; DA. 1976; PP. (180P.); BIBL. 4 P. 1/2; (THESE DOCT. 3E. CYCLE, SPEC. MATH.; PARIS VII)Thesis

UNE APPLICATION DES NOTIONS DU CENTRE ET INDEX RATIONNEL A CERTAINS LANGAGES ALGEBRIQUESGABARRO J.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 4; PP. 317-329; ABS. ENG; BIBL. 10 REF.Article

A STRONG PUMPING LEMMA FOR CONTEXT-FREE LANGUAGES.WISE DS.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 359-369; BIBL. 9 REF.Article

ON THE SEPARATING POWER OF EOL SYSTEMSEHRENFEUCHT A; ROZENBERG G.1983; R.A.I.R.O. INFORMATIQUE THEORIQUE; ISSN 0399-0540; FRA; DA. 1983; VOL. 17; NO 1; PP. 13-22; ABS. FRE; BIBL. 10 REF.Article

LANGAGES ALGEBRIQUES ET SYSTEMES DE REECRITURE RATIONNELSCHOTTIN L.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 2; PP. 93-112; ABS. ENG; BIBL. 14 REF.Article

INDECIDABILITE DE LA CONDITION IRSAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 2; PP. 129-138; ABS. ENG; BIBL. 14 REF.Article

UN RESULTAT DE DISCONTINUITE DANS LES FAMILLES DE LANGAGESAUTEBERT JM.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 64-69; ABS. ENG; BIBL. 8 REF.Conference Paper

ON EQUIVALENCE AND CONTAINMENT PROBLEMS FOR FORMAL LANGUAGES.HUNT HB III; ROSENKRANTZ DJ.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 387-396; BIBL. 24 REF.Article

ORDRES ET TYPES DE LANGAGES.BOASSON L; NIVAT M.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 284; NO 12; PP. 702-705; ABS. ANGL.; BIBL. 3 REF.Article

SOME OPEN PROBLEMS IN THE THEORY OF COMPUTATION AS QUESTIONS ABOUT TWO-WAY DETERMINISTIC PUSHDOWN AUTOMATON LANGUAGES.GALIL Z.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 3; PP. 211-228; BIBL. 1 P.Article

EQUIVALENCE ENTRE LA FAMILLE DES ENSEMBLES REGULIERS ET LA FAMILLE DES ENSEMBLES ALGEBRIQUES.LESCANNE P.1976; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., INFORM THEOR.; FR.; DA. 1976; VOL. 10; NO 8; PP. 57-81; BIBL. 24 REF.Article

SUR LES GENERATEURS ALGEBRIQUES ET LINEAIRESLATTEUX M.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 4; PP. 347-363; ABS. ENG; BIBL. 25 REF.Article

UN LANGAGE ALGEBRIQUE PARTICULIERBOASSON L.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 203-215; ABS. ENG; BIBL. 12 REF.Article

A PROPOS D'UN LANGAGE PRESQUE RATIONNELDAUCHET M; LATTEUX M.1981; C.R. SEANCES ACAD. SCI., SER. 1; FRA; DA. 1981; VOL. 292; NO 1; PP. 107-110; ABS. ENG; BIBL. 7 REF.Article

COMPLEXITY ARGUMENTS IN ALGEBRAIC LANGUAGE THEORYALT H; MEHLHORN K.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 217-225; ABS. FRE; BIBL. 9 REF.Article

SUR LES ENSEMBLES DE MOTS INFINIS ENGENDRES PAR UNE GRAMMAIRE ALGEBRIQUENIVAT M.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 259-278; BIBL. 4 REF.Article

A DECIDABILITY RESULT FOR DETERMINISTIC OMEGA -CONTEXT-FREE LANGUAGES.LINNA M.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 1; PP. 83-98; BIBL. 12 REF.Article

GENERALIZED DIVISION FOR RELATIONAL ALGEBRAIC LANGUAGEDEMOLOMBE R.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 174-178; BIBL. 5 REF.Article

CONTRIBUTION A L'ETUDE DES CONES MINIMAUXAUTEBER JM; BEAUQUIER J; BOASSON L et al.1978; C.R. ACAD. SCI., A; FRA; DA. 1978; VOL. 287; NO 5; PP. 353-355; ABS. ENG; BIBL. 4 REF.Article

ORDRES ET TYPES DE LANGAGES.BOASSON L; NIVAT M.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 284; NO 11; PP. 625-628; ABS. ANGL.; BIBL. 2 REF.Article

LANGAGES POLYADIQUES ALGEBRIQUES. THEORIE DES SCHEMAS DE PROGRAMMES: SEMANTIQUE DE L'APPEL PAR VALEUR.BOUDOL G.sd; S.L.; DA. S.D.; PP. (156P.); BIBL. 2 P. 1/2; (THESE DOCT. 3E. CYCLE, SPEC. MATH.; PARIS VII)Thesis

SUR UNE PROPRIETE D'ITERATION DES LANGAGES ALGEBRIQUES DETERMINISTESSAKAROVITCH J.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 3; PP. 247-288; ABS. ENG; BIBL. 34 REF.Article

LANGAGES SUR DES ALPHABETS INFINISAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 1; PP. 1-20; ABS. ENG; BIBL. 20 REF.Article

QUELQUES PROBLEMES OUVERTS EN THEORIE DES LANGAGES ALGEBRIQUESAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 4; PP. 363-379; ABS. ENG; BIBL. 58 REF.Article

  • Page / 13