Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CONCATENATION")

Filter

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

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

Origin

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

Results 1 to 25 of 1189

  • Page / 48
Export

Selection :

  • and

CONCATENATED CODES FOR THE LEE METRICASTOLA JT.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 5; PART 1; PP. 778-779; BIBL. 9 REF.Article

SUPERIMPOSED CONCATENATED CODESSUGIYAMA Y; KASAHARA M; HIRASAWA S et al.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 6; PP. 735-736; BIBL. 5 REF.Article

CLOSURE PROPERTIES OF THREE-WAY AND FOUR-WAY TAPE-BOUNDED TWO-DIMENSIONAL TURING MACHINESINOUE K; TAKANAMI I.1979; INFORM. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 247-265; BIBL. 6 REF.Article

EXEMPLES DE PREDICATS NE S'EXPRIMANT PAS PAR DES FORMULES S-RUDIMENTAIRESNEPOMNYASHCHIJ VA.1978; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1978; NO 2; PP. 44-46; ABS. ANGL.; BIBL. 4 REF.Article

NEW CONVOLUTIONAL CODES. III.WU WW.1976; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1976; VOL. 24; NO 9; PP. 946-955; BIBL. 15 REF.Article

SUR LE POINT DE CONCATENATION NON AMBIGU.SCHUTZENBERGER MP.1976; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1976; NO 181; PP. 1-29; ABS. ANGL.; BIBL. 1 P. 1/2Serial Issue

FINITE-TURN REPETITIVE CHECKING AUTOMATA AND SEQUENTIAL/PARALLEL MATRIX LANGUAGESSHEN PEI WANG P.1981; I.E.E.E. TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 5; PP. 366-370; BIBL. 17 REF.Article

ORDERED CATENATION AND REGULAR FREE DISJUNCTIVE LANGUAGESSHYR HJ.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 257-269; BIBL. 4 REF.Article

ON STORING CONCATENABLE ARRAYS.ROSENBERG AL.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 2; PP. 157-174; BIBL. 4 REF.Article

IN VITRO CATENATION AND DECATENATION OF DNA AND A NOVEL EUCARYOTIC ATP-DEPENDENT TOPOISOMERASEBALDI MI; BENEDETTI P; MATTOCCIA E et al.1980; CELL; USA; DA. 1980; VOL. 20; NO 2; PP. 461-467; BIBL. 15 REF.Article

A DESCRIPTION METHOD OF HANDPRINTED CHINESE CARACTERSAGUI T; NAGAHASHI H.1979; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1979; VOL. 1; NO 1; PP. 20-24; BIBL. 7 REF.Article

A NEW CONCATENATED MATRIX CODE WITH CLUSTER, BURST AND RANDOM ERROR CORRECTING ABILITIESVOUKALIS DC.1980; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1980; VOL. 49; NO 5; PP. 345-357; BIBL. 6 REF.Article

DECATENATION OF THE KINETOPLAST DNA NETWORK OF TRYPANOSOMES BY A BACTERIAL DNA-GYRASEKAYSER A; DOUC RASY S; RIOU G et al.1982; BIOCHIMIE; ISSN 0300-9084; FRA; DA. 1982; VOL. 64; NO 4; PP. 285-288; ABS. FRE; BIBL. 17 REF.Article

MULTIHEAD FINITE STATE AUTOMATA AND CONCATENATIONDURIS P; HROMKOVIC J.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 176-186; BIBL. 11 REF.Conference Paper

AN ALGEBRAIC APPROACH TO CONCURRENCEWINKOWSKI J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 523-532; BIBL. 5 REF.Conference Paper

FORMATION AND RESOLUTION OF DNA CATENANES BY DNA GYRASEKREUZER KN; COZZARELLI NR.1980; CELL; USA; DA. 1980; VOL. 20; NO 1; PP. 245-254; BIBL. 34 REF.Article

PERFORMANCE OF CONCATENATED DUAL-K CODES ON A RAYLEIGH FADING CHANNEL WITH A BANDWIDTH CONSTRAINTPROAKIS JG; RAHMAN I.1979; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1979; VOL. 27; NO 5; PP. 801-806; BIBL. 8 REF.Article

DIGITAL TECHNIQUES FOR COMPUTER VOICE RESPONSE: IMPLEMENTATIONS AND APPLICATIONS.RABINER LR; SCHAFER RW.1976; PROC. I.E.E.E.; U.S.A.; DA. 1976; VOL. 64; NO 4; PP. 416-433; BIBL. 32 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

REASONING ABOUT ARRAYSREYNOLDS JC.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 5; PP. 290-299; BIBL. 11 REF.Article

DESIGN OF EFFICIENT CODING AND MODULATION FOR A RAYLEIGH FADING CHANNEL = CONCEPTION D'UN CODAGE ET D'UNE MODULATION EFFICACES POUR UNE VOIE DE TRANSMISSION A EVANOUISSEMENT DE RAYLEIGHPIEPER JF; PROAKIS JG; REED RR et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 4; PP. 457-468; BIBL. 18 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

Analysis of a digit concatenation approach to constant creationO'NEILL, Michael; DEMPSEY, Ian; BRABAZON, Anthony et al.Lecture notes in computer science. 2003, pp 173-182, issn 0302-9743, isbn 3-540-00971-X, 10 p.Conference Paper

Canonical decomposition of a regular factorial languageAVGUSTINOVICH, S. V; FRID, A. E.Lecture notes in computer science. 2006, pp 18-22, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 5 p.Conference Paper

One-way multihead finite automata are not closed under concatenationDURIS, P; HROMKOVIC, J.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 121-125, issn 0304-3975Article

  • Page / 48