Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22SYSTEME LINDENMAYER%22)

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 2912

  • Page / 117
Export

Selection :

  • and

A Kleene-Schützenberger theorem for Lindenmayerian rational power seriesHONKALA, Juha.Theoretical informatics and applications. 2000, Vol 34, Num 4, pp 297-305Article

The finiteness of synchronous, tabled picture languages is decidableTRUTHE, Bianca.Theoretical computer science. 2006, Vol 366, Num 3, pp 297-315, issn 0304-3975, 19 p.Conference Paper

Watson-Crick D0L systems: generative power and undecidable problemsSOSIK, Petr.Theoretical computer science. 2003, Vol 306, Num 1-3, pp 101-112, issn 0304-3975, 12 p.Article

Incorporating Lindenmayer systems for architectural development in a functional-structural tree modelPERTTUNEN, Jari; SIEVÄNEN, Risto.Ecological modelling. 2005, Vol 181, Num 4, pp 479-491, issn 0304-3800, 13 p.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

Some non-biological applications of L-systemsGOEL, N. S; ROZEHNAL, I.International journal of general systems (Print). 1991, Vol 18, Num 4, pp 321-405, issn 0308-1079Article

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

From artificial life to real life : computer simulation of plant growthGOEL, N. S; KNOX, L. B; NORMAN, J. M et al.International journal of general systems (Print). 1991, Vol 18, Num 4, pp 291-319, issn 0308-1079Conference Paper

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

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

SUR LES TOL-SYSTEMES UNAIRES.LATTEUX M.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 3; PP. 51-62; ABS. ANGL.; BIBL. 12 REF.Article

IL-22 : A critical mediator in mucosal host defenseAUJLA, S. J; KOLLS, J. K.Journal of molecular medicine (Berlin. Print). 2009, Vol 87, Num 5, pp 451-454, issn 0946-2716, 4 p.Article

  • Page / 117