![]() |
. | . | ![]() |
. | ||||
On extended simple eco-grammar systems
Judit CSIMA3
Abstract
In this contribution extended simple eco-grammar systems are studied. A simple eco-grammar system is formed from an environment given by a set of 0L rules and from some agents represented by sets of CF rules. In an extended simple eco-grammar system we distinguish a subset of the alphabet of the system and only strings over this subalphabet are in the generated language. The relations between language classes generated with different parameters and derivation modes are investigated. Footnotes:
1 Research supported by the Hungarian Scientific Foundation ``OTKA'' Grant No. T017105. Presented at the Conference of PhD Students on Computer Science, July 18-22 1998, Szeged. 2 Research supported by the Hungarian Scientific Foundation ``OTKA'' Grant No. T017105. Presented at the Conference of PhD Students on Computer Science, July 18-22 1998, Szeged. 3 Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary. E-mail: csima@luna.aszi.sztaki.hu |
||||||||
| Webmaster:webmaster@inf.u-szeged.hu |