au.\*:("SALOMAA A")
Results 1 to 25 of 98
Selection :
ON COLOR-FAMILIES OF GRAPHSSALOMAA A.1981; ANN. ACAD. SCI. FENN., SER. A1, MATH.; ISSN 0066-1953; FIN; DA. 1981; VOL. 6; NO 1; PP. 135-148; BIBL. 18 REF.Article
UNDECIDABLE PROBLEMS CONCERNING GROWTH IN INFORMATIONLESS LINDEMAYER SYSTEMS.SALOMAA A.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 7; PP. 331-335; ABS. ALLEM. RUSSE; BIBL. 11 REF.Article
RECENT RESULTS ON L SYSTEMS.SALOMAA A.1976; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1976; NO 45; PP. 115-123; BIBL. 16 REF.; (MATH. FOUND. COMPUT. SCI. SYMP. 5. PROC.; GDANSK; 1976)Conference Paper
MATRIX GRAMMARS WITH A LEFTMOST RESTRICTIONSALOMAA A.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 20; NO 2; PP. 143-149; BIBL. 9 REF.Serial Issue
L. SYSTEMS.ROZENBERG; SALOMAA A.1974; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1974; VOL. 15; PP. 1-338; BIBL. 12 P.Article
Many aspects of formal languagesSALOMAA, A.Information sciences. 1991, Vol 58-57, Num 0, pp 119-129, issn 0020-0255Article
TABLE SYSTEMS WITH UNCONDITIONAL TRANSFERROZENBERG G; SALOMAA A.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 319-322; BIBL. 4 REF.Article
Simple reductions between D0L language and sequence equivalence problemsSALOMAA, A.Discrete applied mathematics. 1993, Vol 41, Num 3, pp 271-274, issn 0166-218XArticle
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
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
SYSTOLIC AUTOMATA FOR VLSI ON BALANCED TREESCULIK K II; GRUSKA J; SALOMAA A et al.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 335-344; BIBL. 4 REF.Article
COMPLETENESS OF CONTEXT-FREE GRAMMAR FORMSMAURER HA; SALOMAA A; WOOD D et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 1; PP. 1-10; BIBL. 14 REF.Article
SYNCHRONIZED EOL FORMSMAURER HA; SALOMAA A; WOOD D et al.1980; THEOR. COMPUTER SCI; NLD; DA. 1980; VOL. 12; NO 2; PP. 135-159; BIBL. 14 REF.Article
UNIFORM INTERPRETATIONS OF L FORMS.MAURER HA; SALOMAA A; WOOD D et al.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 2; PP. 157-173; BIBL. 7 REF.Article
L CODES AND NUMBER SYSTEMSMAURER HA; SALOMAA A; WOOD D et al.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 22; NO 3; PP. 331-346; BIBL. 6 REF.Article
CONTEXT-FREE GRAMMAR FORMS WITH STRICT INTERPRETATIONSMAURER HA; SALOMAA A; WOOD D et al.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 1; PP. 110-135; BIBL. 16 REF.Article
RELATIVE GOODNESS OF EOL FORMSMAURER HA; SALOMAA A; WOOD D et al.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 291-304; BIBL. 6 REF.Article
ON THE FORM EQUIVALENCE OF L-FORMS.MAURER H; OTTMANN T; SALOMAA A et al.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 2; PP. 199-225; BIBL. 6 REF.Article
DEVELOPMENTAL SYSTEMS WITH FRAGMENTATION.ROZENBERG G; RUOHONEN K; SALOMAA A et al.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 177-191; BIBL. 7 REF.Article
A SUPERNORMAL-FORM THEOREM FOR CONTEXT-FREE GRAMMARSMAURER HH; SALOMAA A; WOOD D et al.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 95-102; BIBL. 12 REF.Article
MSW SPACESMAURIER HA; SALOMAA A; WOOD D et al.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 187-199; BIBL. 15 REF.Article
ETOL FORMS.MAURER HA; SALOMAA A; WOOD D et al.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 3; PP. 345-361; BIBL. 15 REF.Article
EOL FORMS.MAURER HA; SALOMAA A; WOOD D et al.1977; ACTA INFORMAT.; DTSCH.; DA. 1977; VOL. 8; NO 1; PP. 75-96; BIBL. 18 REF.Article
BIBLIOGRAPHY OF L SYSTEMS.ROZENBERG G; PENTTONEN M; SALOMAA A et al.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 3; PP. 339-354Article
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