Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DETERMINISTIC 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 182

  • Page / 8

Export

Selection :

  • and

HYPERCODES IN DETERMINISTIC AND SLENDER OL LANGUAGESHEAD T; THIERRIN G.1980; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1980; VOL. 45; NO 3; PP. 251-262; BIBL. 17 REF.Article

NORMAL FORMS OF DETERMINISTIC GRAMMARS.GELLER MM; HARRISON MA; HAVEL IM et al.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 4; PP. 313-321; BIBL. 20 REF.Article

APPLICATION DES C(1,1)-GRAMMAIRES A PRIORITES POUR LA DESCRIPTION DES LANGAGES DETERMINISTESMIRONOVA IV; STANEVICHENE LI.1982; ZURNAL VYCISLITEL'NOJ MATEMATIKI I MATEMATICESKOJ FIZIKI; ISSN 0044-4669; SUN; DA. 1982; VOL. 22; NO 5; PP. 1227-1236; BIBL. 16 REF.Article

PROBLEME D'EQUIVALENCE POUR LES MACHINES DE CALCUL A ROTATION FINIEREDIKO VN; LISOVIK LP.1980; KIBERNETIKA; UKR; DA. 1980; NO 4; PP. 26-28; BIBL. 5 REF.Article

UNE NOTE SUR LE CYLINDRE DES LANGAGES DETERMINISTESAUTEBERT JM.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 3; PP. 395-399; BIBL. 7 REF.Article

THE EQUIVALENCE PROBLEM FOR SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1166-1181; BIBL. 17 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

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

ON THE RECURSION-THEORETIC COMPLEXITY OF RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGESHAY L.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 2-7; BIBL. 5 REF.Article

ITERATION THEOREMS FOR FAMILIES OF STRICT DETERMINISTIC LANGUAGESKING KN.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 317-333; BIBL. 12 REF.Article

A DECISION METHOD FOR THE EQUIVALENCE OF SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 29-38; BIBL. 18 REF.Conference Paper

STRICT DETERMINISTIC LANGUAGES AND CONTROLLED REWRITING SYSTEMSCHOTTIN L.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 104-117; BIBL. 19 REF.Conference Paper

ON THE SUCCINTNESS OF DIFFERENT REPRESENTATIONS OF LANGUAGESHARTMANIS J.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 114-120; BIBL. 6 REF.Article

GLOBAL CONTEXT RECOVERY: A NEW STRATEGY FOR PARSER RECOVERY FROM SYNTAX ERRORSPAI AB; KIEBURTZ RB.1979; SIGPLAN NOT.; USA; DA. 1979; VOL. 14; NO 8; PP. 158-167; BIBL. 5 REF.Conference Paper

PARSING MACRO GRAMMARS TOP DOWNMEHLHORN K.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 2; PP. 123-143; BIBL. 10 REF.Article

A NOTE ON CYCLIC CLOSURE OPERATIONSINOUE K; TAKANAMI I.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 15-16; BIBL. 7 REF.Article

NON-PRINCIPALITE DU CYLINDRE DES LANGAGES A COMPTEURAUTEBERT JM.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 157-167; ABS. ENG; BIBL. 11 REF.Article

A NOTE ON THE SUCCINCTNESS OF DESCRIPTIONS OF DETERMINISTIC LANGUAGES.VALIANT LG.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 32; NO 2; PP. 139-145; BIBL. 10 REF.Article

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

ON DETERMINISTIC INDEXED LANGUAGESPARCHMANN R; DUSKE J; SPECHT J et al.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 45; NO 1; PP. 48-67; BIBL. 6 REF.Article

REFINING NONDETERMINISM IN CONTEXT-FREE LANGUAGESKINTALA CMR.1978; MATH. SYST. THEORY; USA; DA. 1978; VOL. 12; NO 1; PP. 1-8; BIBL. 8 REF.Article

TAPE BOUNDS FOR SOME SUBCLASSES OF DETERMINISTIC CONTEXT-FREE LANGUAGES.IGARASHI Y.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 37; NO 3; PP. 321-333; BIBL. 20 REF.Article

SUR LES ENSEMBLES ALGEBRIQUES D'ARBRES ET LES LANGAGES DETERMINISTES; QUELQUES APPLICATIONS A LA THEORIE DES SCHEMAS DE PROGRAMME.COURCELLE B.1976; ; S.L.; DA. 1976; PP. (163P.); BIBL. 2 P. 1/2; (THESE DOCT. SPEC. MATH.; PARIS VII)Thesis

SERIES ALGEBRIQUES SOLUTIONS D'EQUATIONS LINEAIRES AVEC OPERATEURSDULUCQ S.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 2; PP. 139-163; ABS. ENG; BIBL. 11 REF.Article

SUCCINCTNESS, VERIFIABILITY AND DETERMINISM IN REPRESENTATIONS OF POLYNOMIAL-TIME LANGUAGESBAKER TP; HARTMANIS J.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 392-396; BIBL. 11 REF.Conference Paper

  • Page / 8