Lambda-confluence for context rewriting systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10320050" target="_blank" >RIV/00216208:11320/15:10320050 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.tcs.2015.01.013" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2015.01.013</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2015.01.013" target="_blank" >10.1016/j.tcs.2015.01.013</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Lambda-confluence for context rewriting systems

Popis výsledku v původním jazyce

Clearing restarting automata and limited context restarting automata are particular types of context rewriting systems. A word w is accepted by such a system if there is a sequence of rewritings that reduces the word w to the empty word lambda, where each rewrite rule is extended by certain context conditions. If each rewrite step is strictly length-reducing, as for example in the case of clearing restarting automata, then the word problem for such a system can be solved nondeterministically in quadratic time. If, in addition, the contextual rewritings happen to be lambda-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that lambda-confluence is decidable in polynomial time for limited context restarting automata of type R-2, but that this property is not even recursively enumerable for clearing restarting automata. The latter follows from the fact that lambda-confluence is not re

Název v anglickém jazyce

Lambda-confluence for context rewriting systems

Popis výsledku anglicky

Clearing restarting automata and limited context restarting automata are particular types of context rewriting systems. A word w is accepted by such a system if there is a sequence of rewritings that reduces the word w to the empty word lambda, where each rewrite rule is extended by certain context conditions. If each rewrite step is strictly length-reducing, as for example in the case of clearing restarting automata, then the word problem for such a system can be solved nondeterministically in quadratic time. If, in addition, the contextual rewritings happen to be lambda-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that lambda-confluence is decidable in polynomial time for limited context restarting automata of type R-2, but that this property is not even recursively enumerable for clearing restarting automata. The latter follows from the fact that lambda-confluence is not re

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F10%2F0783" target="_blank" >GAP103/10/0783: Struktura a její využití při rozpoznávání</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

578

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

12

Strana od-do

88-99

Kód UT WoS článku

000353851700008

EID výsledku v databázi Scopus

2-s2.0-84951757776