Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("CULIK K II")

Publication Year[py]

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

Discipline (document) [di]

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 52

  • Page / 3
Export

Selection :

  • and

ON THE HOMOMORPHIC CHARACTERIZATIONS OF FAMILIES OF LANGUAGESCULIK K II.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 161-170; BIBL. 13 REF.Conference Paper

SOME DECIDABILITY RESULTS ABOUT REGULAR AND PUSHDOWN TRANSLATIONSCULIK K II.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 5-8; BIBL. 5 REF.Article

THE ULTIMATE EQUIVALENCE PROBLEM FOR DOL SYSTEMSCULIK K II.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 10; NO 1; PP. 79-84; BIBL. 10 REF.Article

ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMSCULIK K II; SALOMAA A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 29-38; BIBL. 12 REF.Article

TREE CORRESPONDENCE PROBLEMSALBERT J; CULIK K II.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 167-179; BIBL. 5 REF.Article

ON THE EQUALITY SETS FOR HOMOMORPHISMS ON FREE MONOIDS WITH TWO GENERATORSCULIK K II; KARHUMAKI J.1980; R.A.I.R.O. INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1980; VOL. 14; NO 4; PP. 349-369; ABS. FRE; BIBL. 13 REF.Article

INTERACTIVE L SYSTEMS WITH ALMOST INTERACTION LESS BEHAVIOURCULIK K II; KARHUMAKI J.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 83-100; BIBL. 7 REF.Article

ON THE DECIDABILITY OF HOMOMORPHISM EQUIVALENCE FOR LANGUAGESCULIK K II; SALOMAA A.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 2; PP. 163-175; BIBL. 5 REF.Article

SPEED-VARYING OL SYSTEMS.CULIK K II; WOOD D.1978; INFORM. SCI.; U.S.A.; DA. 1978; VOL. 14; NO 2; PP. 161-170; BIBL. 4 REF.Article

THE DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR DOL-SYSTEMS.CULIK K II; FRIS I.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 1; PP. 20-39; BIBL. 11 REF.Article

PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT.CULIK K II; LINDENMAYER A.1976; INTERNATION. J. GEN. SYST.; G.B.; DA. 1976; VOL. 3; NO 1; PP. 53-66; BIBL. 21 REF.Article

LITERAL HOMOMORPHISMS OF OL-LANGUAGES.CULIK K II; OPATRNY J.1974; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 247-267; BIBL. 11 REF.Article

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

GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PRARALLEL REWRITINGLINDENMAYER A; CULIK K II.1979; INTERNATION. J. GEN. SYST.; GBR; DA. 1979; VOL. 5; NO 1; PP. 45-55; BIBL. 36 REF.Article

THE W-SEQUENCE EQUIVALENCE PROBLEM FOR DOC SYSTEMS IS DECIDABLECULIK K II; HARJU T.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 1-6; BIBL. 15 REF.Conference Paper

TEST SETS FOR HOMOMORPHISM EQUIVALENCE ON CONTEXT FREE LANGUAGESALBERT J; CULIK K II.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 12-18; BIBL. 13 REF.Conference Paper

TEST SETS FOR HOMOMORPHISM EQUIVALENCE ON CONTEXT FREE LANGUAGESALBERT J; CULIK K II.1980; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1980; VOL. 45; NO 3; PP. 273-284; BIBL. 12 REF.Article

A HOMOMORPHIC CHARACTERIZATION OF TIME AND SPACE COMPLEXITY CLASSES OF LANGUAGESCULIK K II; DIAMOND ND.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 207-222; BIBL. 9 REF.Article

ON SIMPLE REPRESENTATIONS OF LANGUAGE FAMILIESCULIK K II; MAURER HA.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 241-250; ABS. FRE; BIBL. 14 REF.Article

SECURE INFORMATION STORAGE AND RETRIEVAL USING NEW RESULTS IN CRYPTOGRAPHYCULIK K II; MAURER HA.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 181-186; BIBL. 5 REF.Article

A MATHEMATICAL INVESTIGATION OF PROPAGATING GRAPH OL SYSTEMSCULIK K II; WOOD D.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 50-82; BIBL. 2 P.Article

TRANSDUCTIONS AND THE PARALLEL GENERATION OF LANGUAGESCULIK K II; HEAD T.1983; INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; ISSN 0020-7160; GBR; DA. 1983; VOL. 13; NO 1; PP. 3-15; BIBL. 18 REF.Article

ON TEST SETS AND THE EHRENFEUCHT CONJECTURECULIK K II; KARHVMAKI J.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 128-140; BIBL. 17 REF.Conference Paper

LINKED FOREST MANIPULATION SYSTEMS. A TOOL FOR COMPUTATIONAL SEMANTICSCULIK K II; MANSOUR FARAH.1981; ADV. INF. SYST. SCI.; ISSN 0065-2784; USA; DA. 1981; VOL. 8; PP. 75-118; BIBL. 14 REF.Article

INTERACTIVE L SYSTEMS WITH ALMOST INTERACTIONLESS BEHAVIOURCULIK K II; KARHUMAKI J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 246-257; BIBL. 8 REF.Conference Paper

  • Page / 3