Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("REGULAR 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 776

  • Page / 32
Export

Selection :

  • and

POLYNOMIAL TIME INFERENCE OF EXTENDED REGULAR PATTERN LANGUAGESSHINOHARA T.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 147; PP. 115-127; BIBL. 10 REF.Conference Paper

ON PREDECESSORS OF FINITE LANGUAGESMAURER HA; SALOMAA A; WOOD D et al.1982; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 50; NO 3; PP. 259-275; BIBL. 9 REF.Article

A HOMOMORPHIC CHARACTERIZATION OF REGULAR LANGUAGESCULIK K II; FICH FE; SALOMAA A et al.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 2; PP. 149-152; BIBL. 5 REF.Article

A RESULT CONCERNING THE TRIOS GENERATED BY COMMUTATIVE SLIP-LANGUAGESKORTELAINEN J.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 3; PP. 233-236; BIBL. 4 REF.Article

EQUALITY LANGUAGES AND FIXED POINT LANGUAGESENGELFRIET J; ROZENBERG G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 20-49; BIBL. 19 REF.Article

CIRCULAR CODES AND SYNCHRONIZATION.LASSEZ JL.1977; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1977; VOL. 5; NO 2; PP. 201-208; BIBL. 7 REF.Article

A REMARK ON REGULARITY OF PARALLEL LANGUAGESRUOHONEN K.1983; INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; ISSN 0020-7160; GBR; DA. 1983; VOL. 12; NO 3-4; PP. 241-248; BIBL. 11 REF.Article

A HIERARCHY OF REGULAR TRACE LANGUAGES AND SOME COMBINATORIAL APPLICATIONSBERTONI A; MAURI G; SABADINI N et al.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 146-153; BIBL. 10 REF.Conference Paper

EQUIVALENCE PROBLEMS FOR MAPPINGS ON INFINITE STRINGSCULIK K II; PACHL JK.1981; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 1; PP. 52-63; BIBL. 8 REF.Article

CONDITIONS ENFORCING REGULARITY OF CONTEXT-FREE LANGUAGESEHRENFEUCHT A; HAUSSLER D; ROZENBERG G et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 187-191; BIBL. 16 REF.Conference Paper

CRITERE METRIQUE DE REGULARITE DES LANGAGES REPRESENTES DANS LES AUTOMATES DENOMBRABLESABLAEV FM.1982; IZVESTIJA VYSSIH UCEBNYH ZAVEDENIJ. MATEMATIKA.; ISSN 0021-3446; SUN; DA. 1982; NO 9; PP. 67-69; BIBL. 5 REF.Article

ON REGULARITY OF TIME-VARIANT LANGUAGESMASALAGIU C.1981; AN. STUENT. UNIV. "AL. I. CUZA" IASI, SECT. 1A; ISSN 0041-9109; ROM; DA. 1981; VOL. 27; NO 2; PP. 417-420; BIBL. 2 REF.Article

SUCCINCT REPRESENTATION OF REGULAR LANGUAGES BY BOOLEAN AUTOMATALEISS E.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 3; PP. 323-330; BIBL. 4 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 495-505; BIBL. 18 REF.Conference Paper

INFERENCE FOR REGULAR BILANGUAGES.BERGER J; PAIR C.1978; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1978; VOL. 16; NO 1; PP. 100-122; BIBL. 19 REF.Article

CORRECTION TO: ON THE DIAGONALS OF N-REGULAR RELATIONS.STARKE PH.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 3; PP. 147-148; BIBL. 1 REF.Article

LINEAR POLARIZATION OF THE LATE-TYPE VARIABLE STARS MU CEP AND MIRA IN YEAR 1981HAYES DP.1982; INF. BULL. VARIABLE STARS; ISSN 0374-0676; HUN; DA. 1982; NO 2064; 4 P.; BIBL. 10 REF.Serial Issue

SYNCHRONIZED BEHAVIOURS OF PROCESSES AND RATIONAL RELATIONSARNOLD A.1982; ACTA INF.; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 1; PP. 21-29; BIBL. 10 REF.Article

PUMPING LEMMAS FOR REGULAR SETSEHRENFEUCHT A; PARIKH R; ROZENBERG G et al.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 536-541; BIBL. 10 REF.Article

CALCUL DU RANG DES SIGMA -ARBRES INFINIS REGULIERSJACOB G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 238-254; ABS. ENG; BIBL. 10 REF.Conference Paper

A NOTE ON THE PUMPING LEMMA FOR REGULAR LANGUAGESYEHUDAI A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 3; PP. 135-136; BIBL. 1 REF.Article

BIJECTIVE A-TRANSDUCERSMAURER HA; NIVAT M.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. 97-100; BIBL. 2 REF.Conference Paper

A NOTE ON THE REGULARITY OF FUZZY LANGUAGES.HIROKAWA S; MIYANO S.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 1; PP. 61-66; BIBL. 3 REF.Article

INTRODUCTION AUX AUTOMATES FINIS ET AUX LANGAGES REGULIERS.BOFFA M.1975; BULL. SOC. MATH. BELG.; BELG.; DA. 1975; VOL. 27; NO 1; PP. 3-27; BIBL. 4 REF.Article

Succinct descriptions of regular languages with binary ○+-NFAsVAN ZIJL, Lynette.Lecture notes in computer science. 2003, pp 72-82, issn 0302-9743, isbn 3-540-40561-5, 11 p.Conference Paper

  • Page / 32