|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
Results
Found 5 publication records. Showing 5 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
52 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
match-bounded, inhibitor, termination, normalization, reachability, regular languages, context-free languages, semi-Thue systems, string rewriting systems |
32 | Hans Zantema |
Termination of String Rewriting Proved Automatically. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
semantic labelling, relative termination, match-bounds, termination, string rewriting |
18 | Martin Korp, Aart Middeldorp |
Match-bounds revisited. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Martin Korp, Aart Middeldorp |
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
7 | Hans Zantema |
TORPA: Termination of Rewriting Proved Automatically. |
RTA |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #5 of 5 (100 per page; Change: )
|
|