Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KARHUMAKI J")

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

Author Country

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

Results 1 to 25 of 55

  • Page / 3
Export

Selection :

  • and

STUDIES OF INFORMATIONLESS L SYSTEMS. SUMMARY OF DISSERTATION.KARHUMAKI J.1976; ANN. UNIV. TURKU., A1; FINL.; DA. 1976; NO 171; PP. 1-7; BIBL. 10 REF.; ISBN 9516413641Serial Issue

ON COMMUTATIVE DTOL SYSTEMSKARHUMAKI J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 2; PP. 207-220; BIBL. 11 REF.Article

ON STRONGLY CUBE-FREE CO-WORDS GENERATED BY BINARY MORPHISMSKARHUMAKI J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 182-189; BIBL. 6 REF.Conference Paper

THE DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR POLYNOMIALLY BOUNDED DOL SEQUENCES.KARHUMAKI J.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 1; PP. 17-28; ABS. FR.; BIBL. 9 REF.Article

TWO THEOREMS CONCERNING RECOGNIZABLE N-SUBSETS OF DELTA .KARHUMAKI J.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 4; PP. 317-323; BIBL. 7 REF.Article

THE FAMILY OF PDOL GROWTH-SETS IS PROPERLY INCLUDED IN THE FAMILY OF DOL GROWTH-SETS.KARHUMAKI J.1974; ANN. ACAD. SCI. FENN., A1; FINL.; DA. 1974; NO 590; PP. 1-9; BIBL. 8 REF.Article

ON CUBE-FREE OMEGA -WORDS GENERATED BY BINARY MORPHISMSKARHUMAKI J.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 3; PP. 279-297; BIBL. 11 REF.Article

A property of three-element codesKARHUMAKI, J.Theoretical computer science. 1985, Vol 41, Num 2-3, pp 215-222, issn 0304-3975Article

On three-element codesKARHUMAKI, J.Theoretical computer science. 1985, Vol 40, Num 1, pp 3-11, issn 0304-3975Article

A NOTE ON MORPHIC CHARACTERIZATION OF LANGUAGESKARHUMAKI J; LINNA M.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 2; PP. 243-246; BIBL. 9 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

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

NOTE ON DOL LENGTH SETS.EHRENFEUCHT A; KARHUMAKI J; ROZENBERG G et al.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 233-242; BIBL. 10 REF.Article

Multiplicities : a deterministic view of nondeterminismKARHUMÄKI, J.Theoretical computer science. 1992, Vol 98, Num 1, pp 15-25, issn 0304-3975Conference Paper

TEST SETS FOR CONTEXT FREE LANGUAGES AND ALGEBRAIC SYSTEMS OF EQUATIONS OVER A FREE MONOIDALBERT J; CULIK K II; KARHUMAKI J et al.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 172-186; BIBL. 9 REF.Article

On totalistic systolic networksCULIK, K. II; KARHUMAKI, J.Information processing letters. 1988, Vol 26, Num 5, pp 231-236, issn 0020-0190Article

The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoidsKARHUMAKI, J; SALOMAA, A.Theoretical computer science. 1984, Vol 29, Num 3, pp 285-308, issn 0304-3975Article

A note of the equivalence problem of rational formal power seriesCULIK, K. II; KARHUMAKI, J.Information processing letters. 1986, Vol 23, Num 1, pp 29-31, issn 0020-0190Article

HDTOL matching of computations of multitape automataCULIK II, K; KARHUMAKI, J.Acta informatica. 1989, Vol 27, Num 2, pp 179-191, issn 0001-5903Article

Synchronizable deterministic pushdown automata and the decidability of their equivalenceCULIK, K. II; KARHUMAKI, J.Acta informatica. 1986, Vol 23, Num 5, pp 597-605, issn 0001-5903Article

Inverse morphic equivalence on languagesKARHUMAKI, J; WOOD, D.Information processing letters. 1984, Vol 19, Num 5, pp 213-218, issn 0020-0190Article

The equivalence problem of multitape finite automataHARJU, T; KARHUMAKI, J.Theoretical computer science. 1991, Vol 78, Num 2, pp 347-355, issn 0304-3975, 9 p.Article

A simple undecidable problem: existential agreement of inverses of two morphisms on a regular languageKARHUMAKI, J; MAON, Y.Journal of computer and system sciences (Print). 1986, Vol 32, Num 3, pp 315-322, issn 0022-0000Article

Test sets for morphisms with bounded delayCHOFFRUT, C; KARHUMAKI, J.Discrete applied mathematics. 1985, Vol 12, Num 2, pp 93-101, issn 0166-218XArticle

  • Page / 3