Sciweavers

13 search results - page 2 / 3
» Undecidable Properties on Length-Two String Rewriting System...
Sort
View
AISC
2006
Springer
13 years 9 months ago
The Confluence Problem for Flat TRSs
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...
Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacq...
FSTTCS
2006
Springer
13 years 9 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
FLOPS
2010
Springer
13 years 3 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
DLT
2003
13 years 6 months ago
Tile Rewriting Grammars
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
Stefano Crespi-Reghizzi, Matteo Pradella
RTA
2005
Springer
13 years 10 months ago
Open. Closed. Open
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
Nachum Dershowitz