scispace - formally typeset
Open AccessJournal ArticleDOI

Some properties of the class of L languages with interactions

TLDR
Some properties of the class of L languages with interactions are investigated and is found to be not closed under most of the usually considered operations on languages.
About
This article is published in Journal of Computer and System Sciences.The article was published on 1975-08-01 and is currently open access. It has received 14 citations till now. The article focuses on the topics: Cone (formal languages) & Abstract family of languages.

read more

Citations
More filters
Journal ArticleDOI

Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines*

TL;DR: Characterizations of Lindenmayer systems in terms of Chomsky-type grammars and stack machines are presented and systems with cellular interaction as well as without cellular interaction are studied.
Journal ArticleDOI

On a family of acceptors for some classes of developmental languages

TL;DR: In this article, a machine model consisting of a finite state control and an array of counters with first-in-last-out access is formulated and it is proved that, under certain restrictions, the class of languages accepted is identical to the classes of developmental languages without interactions.
Journal ArticleDOI

Developmental systems with interaction and fragmentation

TL;DR: The basic properties of the families of languages obtained are discussed, as well as their position with respect to other families of developmental languages and the Families of the Chomsky hierarchy.
Journal ArticleDOI

Deterministic Lindenmayer languages, nonterminals and homomorphisms

TL;DR: A systematic classification of the effect of nonterminals, letter-to-letter homomorphicisms, nonerasing homomorphisms and homomorphism for all the basic types of deterministic Lindenmayer systems using context is contained.
Journal ArticleDOI

Bibliography of l systems

TL;DR: This bibliography is a continuation of previous bibliographies of 1, systems, prepared by Lee and Rozenberg and updated the data given in the bibliography mentioned, as well as added all the new items which have come to the authors' knowledge.
References
More filters
Book

Formal Languages and Their Relation to Automata

TL;DR: The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
Journal ArticleDOI

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.
Journal ArticleDOI

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.