Journal Article10.1080/00207167508803105
Parallel OL-languages
Rani Siromoney,Gift Siromoney +1 more
7
About: This article is published in International Journal of Computer Mathematics. The article was published on 01 Jan 1975.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A study in parallel rewriting systems
TL;DR: This paper study systematically three basic classes of grammars incorporating parallel rewriting: Indian parallel Grammars, Russian parallel grammARS and L systems, and introduces new classes of rewriting systems ( ETOL [ k ] systems, ETOLIP systems and ETOLRP systems).
31
Iterated deterministic substitution
TL;DR: Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol for an arbitrary family K of languages.
15
Array Languages and Lindenmayer Systems —A Survey
Rani Siromoney
- 01 Jan 1986
TL;DR: An interesting comment from a referee is a pointer to the extent to which the theory had developed within a span of five years.
15
Filamentous systems with apical growth
TL;DR: AGFS as discussed by the authors is an anti-AFL language where the growth takes place only at the two ends of a sentential form, at each step of a derivation either a left rule to the left most symbol or a right rule to rightmost symbol of a given form.
10
A note on programmed 0L systems
TL;DR: It is proved that the family of programmed 0L languages coincides with thefamily of context free programmed languages, which solves the problem posed by Rajasethupathy and Shyamasundar.
4
References
Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs.
TL;DR: A theory is proposed for the development of filamentous organisms, based on the assumptions that the filaments are composed of cells which undergo changes of state under inputs they receive from their neighbors, and the cells produce outputs as determined by their state and the input they receive.
1.7K
On Context-Free Languages
TL;DR: In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Developmental systems without cellular interactions, their languages and grammars.
TL;DR: Theorems were obtained concerning partial characterizations of the class of developmental systems without cellular interactions, and some of the mathematical properties of this class are discussed.
247
Related Papers (2)
[...]
Arto Salomaa
- 01 Aug 1973