Searching for "Match-Bounded String Rewriting Systems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Termination proofs for string rewriting systems via inverse match-bounds
by Alfons Geser, Dieter Hofbauer, Johannes Waldmann — 2005 — In print
…TERMINATION PROOFS FOR STRING REWRITING SYSTEMS VIA INVERSE MATCH-BOUNDS ∗ Alfons Geser † , Dieter…
Cited by 4 (2 self) – Add To MetaCart

Decomposing terminating rewrite relations
by Jörg Endrullis, Dieter Hofbauer, Johannes Waldmann — 2006 — In Proc. 8th WST
… of match-bounds. 2 Decomposing String Rewriting Systems We denote context-free rewriting systems CF = {R…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB