On prefixal one-rule string rewrite systems

Prefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove,...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2019-11, Vol.795, p.240-256
Main Authors: Latteux, Michel, Roos, Yves
Format: Article
Language:English
Subjects:
Computation and Language
Computer Science
Context free language
One-rule string rewrite system
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3
cites cdi_FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3
container_end_page 256
container_issue
container_start_page 240
container_title Theoretical computer science
container_volume 795
creator Latteux, Michel
Roos, Yves
description Prefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove, in this work, that the transformation induced by a prefixal one-rule rewrite system always transforms a finite language into a context-free language, a property that is surprisingly not satisfied by arbitrary one-rule rewrite systems. We also give here a decidable characterization of the prefixal one-rule rewrite systems whose induced transformation is a rational transduction.
doi_str_mv 10.1016/j.tcs.2019.07.004
format article
fullrecord <record><control><sourceid>elsevier_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02289652v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S030439751930430X</els_id><sourcerecordid>S030439751930430X</sourcerecordid><originalsourceid>FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_wNteRXadJJsvPJWiVij0ouewzU40ZbtbkrXqvzel4tG5DDPMM_A-hFxTqChQebepRpcqBtRUoCqA-oRMqFamZMzUp2QCHOqSGyXOyUVKG8gllJyQ21Vf7CL68NV0xdBjGT86LNIYQ_9WRPyMYczjdxpxmy7JmW-6hFe_fUpeHx9e5otyuXp6ns-WpeOqHksvfKtaDdTLmiuunXNee49OSy0FGtmuldRrYCAZcioMV0yDByep8Eqs-ZTcHP--N53dxbBt4rcdmmAXs6U97IAxbaRge5pv6fHWxSGlHOQPoGAPZuzGZjP2YMaCstlMZu6PDOYQ-4DRJhewd9iGiG607RD-oX8A8i5qMg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On prefixal one-rule string rewrite systems</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Latteux, Michel ; Roos, Yves</creator><creatorcontrib>Latteux, Michel ; Roos, Yves</creatorcontrib><description>Prefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove, in this work, that the transformation induced by a prefixal one-rule rewrite system always transforms a finite language into a context-free language, a property that is surprisingly not satisfied by arbitrary one-rule rewrite systems. We also give here a decidable characterization of the prefixal one-rule rewrite systems whose induced transformation is a rational transduction.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2019.07.004</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Computation and Language ; Computer Science ; Context free language ; One-rule string rewrite system</subject><ispartof>Theoretical computer science, 2019-11, Vol.795, p.240-256</ispartof><rights>2019 Elsevier B.V.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3</citedby><cites>FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3</cites><orcidid>0000-0002-5045-4399</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,776,780,881,27903,27904</link.rule.ids><backlink>$$Uhttps://hal.science/hal-02289652$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Latteux, Michel</creatorcontrib><creatorcontrib>Roos, Yves</creatorcontrib><title>On prefixal one-rule string rewrite systems</title><title>Theoretical computer science</title><description>Prefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove, in this work, that the transformation induced by a prefixal one-rule rewrite system always transforms a finite language into a context-free language, a property that is surprisingly not satisfied by arbitrary one-rule rewrite systems. We also give here a decidable characterization of the prefixal one-rule rewrite systems whose induced transformation is a rational transduction.</description><subject>Computation and Language</subject><subject>Computer Science</subject><subject>Context free language</subject><subject>One-rule string rewrite system</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_wNteRXadJJsvPJWiVij0ouewzU40ZbtbkrXqvzel4tG5DDPMM_A-hFxTqChQebepRpcqBtRUoCqA-oRMqFamZMzUp2QCHOqSGyXOyUVKG8gllJyQ21Vf7CL68NV0xdBjGT86LNIYQ_9WRPyMYczjdxpxmy7JmW-6hFe_fUpeHx9e5otyuXp6ns-WpeOqHksvfKtaDdTLmiuunXNee49OSy0FGtmuldRrYCAZcioMV0yDByep8Eqs-ZTcHP--N53dxbBt4rcdmmAXs6U97IAxbaRge5pv6fHWxSGlHOQPoGAPZuzGZjP2YMaCstlMZu6PDOYQ-4DRJhewd9iGiG607RD-oX8A8i5qMg</recordid><startdate>20191126</startdate><enddate>20191126</enddate><creator>Latteux, Michel</creator><creator>Roos, Yves</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-5045-4399</orcidid></search><sort><creationdate>20191126</creationdate><title>On prefixal one-rule string rewrite systems</title><author>Latteux, Michel ; Roos, Yves</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computation and Language</topic><topic>Computer Science</topic><topic>Context free language</topic><topic>One-rule string rewrite system</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Latteux, Michel</creatorcontrib><creatorcontrib>Roos, Yves</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Latteux, Michel</au><au>Roos, Yves</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On prefixal one-rule string rewrite systems</atitle><jtitle>Theoretical computer science</jtitle><date>2019-11-26</date><risdate>2019</risdate><volume>795</volume><spage>240</spage><epage>256</epage><pages>240-256</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>Prefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove, in this work, that the transformation induced by a prefixal one-rule rewrite system always transforms a finite language into a context-free language, a property that is surprisingly not satisfied by arbitrary one-rule rewrite systems. We also give here a decidable characterization of the prefixal one-rule rewrite systems whose induced transformation is a rational transduction.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2019.07.004</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-5045-4399</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0304-3975
ispartof Theoretical computer science, 2019-11, Vol.795, p.240-256
issn 0304-3975
1879-2294
language eng
recordid cdi_hal_primary_oai_HAL_hal_02289652v1
source ScienceDirect Freedom Collection 2022-2024
subjects Computation and Language
Computer Science
Context free language
One-rule string rewrite system
title On prefixal one-rule string rewrite systems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T02%3A42%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20prefixal%20one-rule%20string%20rewrite%20systems&rft.jtitle=Theoretical%20computer%20science&rft.au=Latteux,%20Michel&rft.date=2019-11-26&rft.volume=795&rft.spage=240&rft.epage=256&rft.pages=240-256&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/j.tcs.2019.07.004&rft_dat=%3Celsevier_hal_p%3ES030439751930430X%3C/elsevier_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c374t-f5fd7d801f643738cccf8ffec86865e96db768b02062e315937280f0c615f75b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true