On Problems Dual to Unification: The String-Rewriting Case

02/28/2021
by   Zümrüt Akçam, et al.
0

In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is computing fixed points in systems, such as loop invariants in programming languages. We show that the fixed point (FP) problem is reducible to the common term problem. Our new results are: (i) the fixed point problem is undecidable for finite convergent string rewriting systems whereas it is decidable in polynomial time for finite, convergent and dwindling string rewriting systems, (ii) the common term problem is undecidable for the class of dwindling string rewriting systems, and (iii) for the class of finite, monadic and convergent systems, the common equation problem is decidable in polynomial time but for the class of dwindling string rewriting systems, common equation problem is undecidable.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/15/2017

A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions

A distributed algorithm is described for finding a common fixed point of...
04/27/2021

Queues with Updating Information: Finding the Amplitude of Oscillations

Many service systems provide customers with information about the system...
05/18/2020

On the Separability Problem of String Constraints

We address the separability problem for straight-line string constraints...
06/01/2021

Computing Least and Greatest Fixed Points in Absorptive Semirings

We present two methods to algorithmically compute both least and greates...
06/24/2019

Dynamic Palindrome Detection

Lately, there is a growing interest in dynamic string matching problems....
04/29/2021

Parameterized String Equations

We study systems of String Equations where block variables need to be as...
12/15/2015

Globally Optimal Joint Uplink Base Station Association and Beamforming

The joint base station (BS) association and beamforming problem has been...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.