Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LANGAGE DETERMINISTE")

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 196

  • Page / 8

Export

Selection :

  • and

AN IMPROVED BOUND FOR DETECTING LOOPING CONFIGURATIONS IN DETERMINISTIC DPA'S.VAN LEEUWEN J; SMITH CH.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 22-24; BIBL. 6 REF.Article

A FACTOR THEOREM FOR SUBSETS OF A FREE MONOID.WOOD D.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 1; PP. 21-26; BIBL. 5 REF.Article

UNE FORME CANONIQUE POUR LES GRAMMAIRES SIMPLES DETERMINISTES.COURCELLE B.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 19-36; ABS. ANGL.; BIBL. 3 REF.Article

NECESSARY AND SUFFICIENT CONDITIONS FOR A POWER LANGUAGE TO BE DETERMINISTIC.SHYAMASUNDAR RK.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 133-142; BIBL. 5 REF.Article

ON WEAK REGULAR PROBABILISTIC LANGUAGES.SANTOS ES.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 4; PP. 356-361; BIBL. 12 REF.Article

JUMP PDA'S AND HIERARCHIES OF DETERMINISTIC CONTEXT-FREE LANGUAGES.GREIBACH SA.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 2; PP. 111-127; BIBL. 1 P.Article

MACHINES, PROGRAMS AND LANGUAGES. = MACHINES, PROGRAMMES ET LANGAGESSANTOS ES.1974; J. CYBERN.; U.S.A.; DA. 1974; VOL. 4; NO 1; PP. 71-86; BIBL. 5 REF.Article

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

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

CONFLUENT AND OTHER TYPES OF THUE SYSTEMSBOOK RV.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 171-182; BIBL. 19 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

A NOTE ON THE RECOGNITION OF ONE COUNTER LANGUAGES.GREIBACH SA.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R. INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 2; PP. 5-12; ABS. FR.; BIBL. 12 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

A PUMPING THEOREM FOR DETERMINISTIC ETOL LANGUAGES.EHRENFUCHT A; ROZENBERG G.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 2; PP. 13-23; ABS. FR.; BIBL. 10 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

BOUNDED CONTEXT PARSABLE GRAMMARS.WILLIAMS JH.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 4; PP. 314-334; BIBL. 14 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

DETERMINISTIC TECHNIQUES FOR EFFICIENT NON-DETERMINISTIC PARSERS.LANG B.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT. RAPP. RECH.; FR.; DA. 1974; NO 72; PP. 1-15; ABS. ANGL.; BIBL. 10 REF.Article

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

  • Page / 8