Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() ![]() |
![]() ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu, VERLAN, Sergey. Regulated insertion-deletion systems. In: Journal of Automata, Languages and Combinatorics, 2022, nr. 1-3(27), pp. 15-45. ISSN 1430-189X. DOI: https://doi.org/10.25596/jalc-2022-015 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Journal of Automata, Languages and Combinatorics | ||||||
Numărul 1-3(27) / 2022 / ISSN 1430-189X /ISSNe 2567-3785 | ||||||
|
||||||
DOI:https://doi.org/10.25596/jalc-2022-015 | ||||||
Pag. 15-45 | ||||||
|
||||||
Rezumat | ||||||
Insertion and deletion operations appear in several areas of theoretical computer sci-ence, as well as in linguistics and DNA computing. In this paper, we investigate insertion and deletion within the regulated rewriting framework, i. e., the rule application is subject to additional constraints. We consider various regulation mechanisms already considered or not in the area of insertion-deletion systems. Beside recalling existing results, we present a series of new results related to the use of prescribed sequences, time-varying and cooperating distributed (CD) controls. |
||||||
Cuvinte-cheie cooperating distributed grammar system, graph-controlled grammar, insertion-deletion, matrix grammar, regulated rewriting, time-varying grammar |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Alhazov, A.E.</dc:creator> <dc:creator>Freund, R.</dc:creator> <dc:creator>Ivanov, S.V.</dc:creator> <dc:creator>Verlan, S.V.</dc:creator> <dc:date>2022-09-01</dc:date> <dc:description xml:lang='en'><p>Insertion and deletion operations appear in several areas of theoretical computer sci-ence, as well as in linguistics and DNA computing. In this paper, we investigate insertion and deletion within the regulated rewriting framework, i. e., the rule application is subject to additional constraints. We consider various regulation mechanisms already considered or not in the area of insertion-deletion systems. Beside recalling existing results, we present a series of new results related to the use of prescribed sequences, time-varying and cooperating distributed (CD) controls. </p></dc:description> <dc:identifier>10.25596/jalc-2022-015</dc:identifier> <dc:source>Journal of Automata, Languages and Combinatorics 27 (1-3) 15-45</dc:source> <dc:subject>cooperating distributed grammar system</dc:subject> <dc:subject>graph-controlled grammar</dc:subject> <dc:subject>insertion-deletion</dc:subject> <dc:subject>matrix grammar</dc:subject> <dc:subject>regulated rewriting</dc:subject> <dc:subject>time-varying grammar</dc:subject> <dc:title>Regulated insertion-deletion systems</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>