Journal Article10.1016/0020-0255(80)90017-1
Programmed OL-systems
4
TL;DR: In this paper, two generalizations of OL-systems are introduced called strong programmed OL- systems and weak programmed OL -systems, the interesting feature is that the class of programmed OLs contains theclass of CFPGs.
read more
About: This article is published in Information Sciences. The article was published on 01 Mar 1980.
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
Iterated sequential transducers as language generating devices
TL;DR: The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level and some results on deterministic and extended iterated finite state transducers are established.
18
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
On Iterated Sequential Transducers.
Henning Bordihn,Henning Fernau,Markus Holzer +2 more
- 01 Jan 2003
1
On the role of expert systems and numerical taxonomy in soil classification
TL;DR: It is concluded that numerical classification has a potentially useful part to play in establishing soil classes and generating rules for assignment in expert systems and the inference procedures and user interface of expert systems should allow more integration and realistic assignment of available data and increase the usefulness and predictability of soil information.
References
•Book
Developmental systems and languages
Aristid Lindenmayer,Grzegorz Rozenberg +1 more
- 01 Jan 1975
TL;DR: Developmental systems were introduced in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms by considering the states and outputs to be identical and thus omitting the output functions.
477
Periodically time-variant context-free grammars
TL;DR: For context-free grammars, all of the following restrictive devices are equivalent with respect to generative power: a regular control language, programming, a set of matrices, and periodic time-variance.
42
Some notes on ETOL-languages
TL;DR: If the order in which the tables of an ETOL-system must be applied is specified, or if a forbidding context is added to the tables, then the resulting class of languages generated, coincides with a subclass of the class of context-free programmed languages.
20
Context in Parallel Rewriting
Karel Culik,Jaroslav Opatrny +1 more
- 14 Jan 1974
TL;DR: The generative power of these new types of context sensitive parallel rewriting systems is investigated and it is compared to the generativePower of TOL- systems, L-systems with interaction, regular grammars and context sensitive Grammars.