• search hit 16 of 23
Back to Result List

Active symbols in grammars with valuations

  • Grammars with valuations are context-free rewriting mechanisms where the derivation process is controlled by a recursive function that evaluates strings. They have been introduced by Jurgen Dassow as models for the molecular replication process taking into account its selective character. A symbol is active in a grammar with valuation if it can be rewritten non-identically. This paper studies the effect of restricting the number of active symbols in grammars with valuations and several variants thereof to their generative power. It is investigated in which cases the number of active symbols induces infinite strict hierarchies and when the hierarchies collapse. The induced language families are compared among one another. (C) 2016 Elsevier B.V. All rights reserved.

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Henning BordihnORCiD
DOI:https://doi.org/10.1016/j.tcs.2016.11.008
ISSN:0304-3975
ISSN:1879-2294
Title of parent work (English):Theoretical computer science
Publisher:Elsevier
Place of publishing:Amsterdam
Publication type:Article
Language:English
Year of first publication:2017
Publication year:2017
Release date:2020/04/20
Tag:Biologically inspired formal systems; Descriptional complexity; Formal languages
Volume:682
Number of pages:7
First page:42
Last Page:48
Peer review:Referiert
Institution name at the time of the publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.