|
L-systems
An L-system or Lindenmayer system is a wikt:parallel, parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make string (computer science), strings, a collection of Production (computer science), production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the Utrecht University, University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals. Origins As a biologist, Lindenmayer worked with yeast and filamentous fungi and studi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractal Weeds
In mathematics, a fractal is a geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scales, as illustrated in successive magnifications of the Mandelbrot set. This exhibition of similar patterns at increasingly smaller scales is called self-similarity, also known as expanding symmetry or unfolding symmetry; if this replication is exactly the same at every scale, as in the Menger sponge, the shape is called affine self-similar. Fractal geometry lies within the mathematical branch of measure theory. One way that fractals are different from finite geometric figures is how they scale. Doubling the edge lengths of a filled polygon multiplies its area by four, which is two (the ratio of the new to the old side length) raised to the power of two (the conventional dimension of the filled polygon). Likewise, if the radius of a filled spher ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractal
In mathematics, a fractal is a Shape, geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scales, as illustrated in successive magnifications of the Mandelbrot set. This exhibition of similar patterns at increasingly smaller scales is called self-similarity, also known as expanding symmetry or unfolding symmetry; if this replication is exactly the same at every scale, as in the Menger sponge, the shape is called affine geometry, affine self-similar. Fractal geometry lies within the mathematical branch of measure theory. One way that fractals are different from finite geometric figures is how they Scaling (geometry), scale. Doubling the edge lengths of a filled polygon multiplies its area by four, which is two (the ratio of the new to the old side length) raised to the power of two (the conventional dimension of the filled polygon). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aristid Lindenmayer
Aristid Lindenmayer (17 November 1925 – 30 October 1989) was a Hungarian biologist. In 1968 he developed a type of formal language today called L-systems or Lindenmayer systems. Using those systems Lindenmayer modelled the behaviour of cells of plants. L-systems nowadays are also used to model whole plants. Lindenmayer worked with yeast and filamentous fungi and studied the growth patterns of various types of algae, such as the blue/green bacteria ''Anabaena catenula''. Originally the L-systems were devised to provide a formal description of the development of such simple multicellular organisms, and to illustrate the neighbourhood relationships between plant cells. Later on, this system was extended to describe higher plants and complex branching structures. Career Lindenmayer studied chemistry and biology at the Eötvös Loránd University of Budapest from 1943 to 1948. He received his Ph.D. in plant physiology in 1956 at the University of Michigan. In 1968 he became pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tuple
In mathematics, a tuple is a finite sequence or ''ordered list'' of numbers or, more generally, mathematical objects, which are called the ''elements'' of the tuple. An -tuple is a tuple of elements, where is a non-negative integer. There is only one 0-tuple, called the ''empty tuple''. A 1-tuple and a 2-tuple are commonly called a singleton and an ordered pair, respectively. The term ''"infinite tuple"'' is occasionally used for ''"infinite sequences"''. Tuples are usually written by listing the elements within parentheses "" and separated by commas; for example, denotes a 5-tuple. Other types of brackets are sometimes used, although they may have a different meaning. An -tuple can be formally defined as the image of a function that has the set of the first natural numbers as its domain. Tuples may be also defined from ordered pairs by a recurrence starting from an ordered pair; indeed, an -tuple can be identified with the ordered pair of its first elements and its t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Self-similarity
In mathematics, a self-similar object is exactly or approximately similar to a part of itself (i.e., the whole has the same shape as one or more of the parts). Many objects in the real world, such as coastlines, are statistically self-similar: parts of them show the same statistical properties at many scales. Self-similarity is a typical property of fractals. Scale invariance is an exact form of self-similarity where at any magnification there is a smaller piece of the object that is similar to the whole. For instance, a side of the Koch snowflake is both symmetrical and scale-invariant; it can be continually magnified 3x without changing shape. The non-trivial similarity evident in fractals is distinguished by their fine structure, or detail on arbitrarily small scales. As a counterexample, whereas any portion of a straight line may resemble the whole, further detail is not revealed. Peitgen ''et al.'' explain the concept as such: Since mathematically, a fractal may sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Life
Artificial life (ALife or A-Life) is a field of study wherein researchers examine systems related to natural life, its processes, and its evolution, through the use of simulations with computer models, robotics, and biochemistry. The discipline was named by Christopher Langton, an American computer scientist, in 1986. In 1987, Langton organized the first conference on the field, in Los Alamos, New Mexico. There are three main kinds of alife, named for their approaches: ''soft'', from software; ''hard'', from computer hardware, hardware; and ''wet artificial life, wet'', from biochemistry. Artificial life researchers study traditional biology by trying to recreate aspects of biological phenomena. Overview Artificial life studies the fundamental processes of living systems in artificial environments in order to gain a deeper understanding of the complex information processing that define such systems. These topics are broad, but often include Evolutionary algorithm, evolutionar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semi-Thue Grammar
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from a (usually finite) alphabet. Given a binary relation R between fixed strings over the alphabet, called rewrite rules, denoted by s\rightarrow t, an SRS extends the rewriting relation to all strings in which the left- and right-hand side of the rules appear as substrings, that is usv\rightarrow utv, where s, t, u, and v are strings. The notion of a semi-Thue system essentially coincides with the presentation of a monoid. Thus they constitute a natural framework for solving the word problem for monoids and groups. An SRS can be defined directly as an abstract rewriting system. It can also be seen as a restricted kind of a term rewriting system, in which all function symbols have an arity of at most 1. As a formalism, string rewriting systems are Turing complete. The semi-Thue name comes from the Norwegian mathematic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chomsky Hierarchy
The Chomsky hierarchy in the fields of formal language theory, computer science, and linguistics, is a containment hierarchy of classes of formal grammars. A formal grammar describes how to form strings from a formal language's alphabet that are valid according to the language's syntax. The linguist Noam Chomsky theorized that four different classes of formal grammars existed that could generate increasingly complex languages. Each class can also completely generate the language of all inferior classes (set inclusive). History The general idea of a hierarchy of grammars was first described by Noam Chomsky in "Three models for the description of language" during the formalization of transformational-generative grammar (TGG). Marcel-Paul Schützenberger also played a role in the development of the theory of formal languages; the paper "The algebraic theory of context free languages" describes the modern hierarchy, including context-free grammars. Independently, alongside linguis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dragon Trees
A dragon is a Magic (supernatural), magical legendary creature that appears in the folklore of multiple cultures worldwide. Beliefs about dragons vary considerably through regions, but European dragon, dragons in Western cultures since the High Middle Ages have often been depicted as winged, horned, and capable of breathing fire. Chinese dragon, Dragons in eastern cultures are usually depicted as wingless, four-legged, Snake, serpentine creatures with above-average intelligence. Commonalities between dragons' traits are often a hybridization of Reptile, reptilian, mammalian, and Bird, avian features. Etymology The word ''dragon'' entered the English language in the early 13th century from Old French , which, in turn, comes from Latin (genitive ), meaning "huge serpent, dragon", from , (genitive , ) "serpent". [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anabaena
''Anabaena'' is a genus of filamentous cyanobacteria that exist as plankton. They are known for nitrogen-fixing abilities, and they form symbiotic relationships with certain plants, such as the mosquito fern. They are one of four genera of cyanobacteria that produce neurotoxins, which are harmful to local wildlife, as well as farm animals and pets. Production of these neurotoxins is assumed to be an input into its symbiotic relationships, protecting the plant from grazing pressure. A DNA sequencing project was undertaken by the United States Department of Energy between 1999 and 2005. This project mapped the complete genome of model organism ''Anabaena variabilis'' ATCC 29413, which is 7.2 million base pairs long. A paper detailing the process was published in 2014. The study focused on heterocysts, which convert nitrogen into ammonia. Certain species of ''Anabaena'' have been used on rice paddy fields, proving to be an effective natural fertilizer. Species List of current ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Law Of Identity
In logic, the law of identity states that each thing is identical with itself. It is the first of the traditional three laws of thought, along with the law of noncontradiction, and the law of excluded middle. However, few systems of logic are built on just these laws. History Ancient philosophy The earliest recorded use of the law appears in Plato's dialogue '' Theaetetus'' (185a), wherein Socrates attempts to establish that what we call "sounds" and "colours" are two different classes of thing: It is used explicitly only once in Aristotle, in a proof in the '' Prior Analytics'': Medieval philosophy Aristotle believed the law of non-contradiction to be the most fundamental law. Both Thomas Aquinas (''Met.'' IV, lect. 6) and Duns Scotus (''Quaest. sup. Met.'' IV, Q. 3) follow Aristotle in this respect. Antonius Andreas, the Spanish disciple of Scotus (d. 1320), argues that the first place should belong to the law "Every Being is a Being" (''Omne Ens est Ens'', Qq. in Met ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Language
In logic, mathematics, computer science, and linguistics, a formal language is a set of strings whose symbols are taken from a set called "alphabet". The alphabet of a formal language consists of symbols that concatenate into strings (also called "words"). Words that belong to a particular formal language are sometimes called ''well-formed words''. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar. In computer science, formal languages are used, among others, as the basis for defining the grammar of programming languages and formalized versions of subsets of natural languages, in which the words of the language represent concepts that are associated with meanings or semantics. In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that can be parsed by machines with limited computational power. In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
