Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("SYSTEME LINDENMAYER")

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 146

  • Page / 6

Export

Selection :

  • and

CHARACTERIZATION OF GROWTH IN DETERMINISTIC LINDENMAYER SYSTEMS.POLLUL W; SCHUTT D.1975; PROC. KKL. NEDERL. AKAD. WETENSCH., A; NETHERL.; DA. 1975; VOL. 78; NO 2; PP. 183-188; BIBL. 8 REF.Article

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

THE EQUIVALENCE PROBLEM OF BINARY EOL-SYSTEMS IS DECIDABLE.KARPINSKI M.1977; PRACE I.P.I. P.A.N.; POLSKA; DA. 1977; NO 298; PP. 1-16; ABS. RUSSE POL.; BIBL. 1 P. 1/2Serial Issue

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

ZEROS OF Z-RATIONAL FUNCTIONS AND DOL EQUIVALENCE.RUOHONEN K.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 283-292; BIBL. 8 REF.Article

DECOMPOSITION THEOREMS FOR VARIOUS KINDS OF LANGUAGES PARALLEL IN NATURE.SKYUM S.1976; S.I.A.M.J. COMPUTG.; U.S.A.; DA. 1976; VOL. 5; NO 2; PP. 284-296; BIBL. 16 REF.Article

REWRITING SYSTEMS WITH LIMITED DISTANCE FORBIDDING CONTEXTVON SOLMS SH.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 227-239; BIBL. 5 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

THE EQUIVALENCE PROBLEM FOR DOL SYSTEMS AND ITS DECIDABILITY FOR BINARY ALPHABETS.VALIANT LG.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 31-37; BIBL. 8 REF.Conference Paper

THE TAPE-COMPLEXITY OF CONTEXT-INDEPENDENT DEVELOPMENTAL LANGUAGES.VAN LEEUWEN J.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 2; PP. 203-211; BIBL. 1 P.Article

DETERMINISTIC LINDENMAYER LANGUAGES, NONTERMINALS AND HOMOMORPHISMS.VITANYI PMB.1974; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1974; NO 28; PP. 1-55; BIBL. 2 P. 1/2Article

ON PROVING THAT CERTAIN LANGUAGES ARE NOT ETOL.EHRENFEUCHT A; ROZENBERG G.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 407-415; BIBL. 7 REF.Article

A DECOMPOSITION THEOREM FOR HYPER-ALGEBRAIC EXTENSIONS OF LANGUAGE FAMILIES.VAN LEEUWEN J; WOOD D.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 199-214; BIBL. 10 REF.Article

CONTEXT SENSITIVE TABLE LINDENMAYER LANGUAGES AND A RELATION TO THE LBA PROBLEM.VITANYI PMB.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 49; PP. 1-12; BIBL. 12 REF.Serial Issue

GRAPH GRAMMARS AND APPLICATIONS TO SPECIALIZATION AND EVOLUTION IN BIOLOGY.EHRIG H; TISCHER KW.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 2; PP. 212-236; BIBL. 10 REF.Article

PARALLEL OL-LANGUAGES.SIROMONEY R; SIROMONEY G.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 109-123; BIBL. 14 REF.Article

ON THE RELATIONSHIP BETWEEN PROPAGATING CONTEXT-DEPENDENT LINDENMAYER SYSTEMS AND CELLULAR AUTOMATA SYSTEMSBUTLER JT.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 28; NO 1; PP. 63-67; BIBL. 5 REF.Article

THE DECIDABILITY OF V-LOCAL CATENATIVITY AND OF OTHER PROPERTIES OF DOL SYSTEMS.CULIK K II.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 1; PP. 33-35; BIBL. 5 REF.Article

JL SYSTEMS WITH NON-FRAGMENTED AXIOMS: THE HIERARCHY.RUOHONEN K.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 143-156; BIBL. 5 REF.Article

RADIAL GRAMMARS AND RADIAL L-SYSTEMS.SIROMONEY G; SIROMONEY R.1975; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 361-374; BIBL. 18 REF.Article

DEVELOPMENT SYSTEMS WITH FINITE AXIOM SETS. II. SYSTEMS WITH INTERACTIONS.ROZENBERG G.1974; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 281-304Article

STABLE STRING LANGUAGES OF LINDENMAYER SYSTEMS.VITANYI PMB; WALKER A.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 2; PP. 134-149; BIBL. 18 REF.Article

THE STRUCTURAL EQUIVALENCE PROBLEM FOR EOL-SYSTEMS IS RECURSIVELY SOLVABLE.KARPINSKI M.1977; PRACE I.P.I. P.A.N.; POLSKA; DA. 1977; NO 299; PP. 1-8; BIBL. 6 REF.Serial Issue

ON THE CHARACTERIZATION OF CERTAIN CLASSES OF DEVELOPMENTAL LANGUAGES BY AUTOMATA.VON SOLMS SH.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 125-132; BIBL. 7 REF.Article

  • Page / 6