|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 9 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl |
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.  |
CAI  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann |
Local Termination: theory and practice |
Logical Methods in Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Johannes Waldmann |
Polynomially Bounded Matrix Interpretations. |
RTA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Koprowski, Johannes Waldmann |
Max/Plus Tree Automata for Termination of Term Rewriting. |
Acta Cybern. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Gebhardt, Johannes Waldmann |
Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. |
Acta Cybern. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann |
Local Termination. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Waldmann |
Automatic Termination. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting. |
J. Autom. Reasoning |
2008 |
DBLP DOI BibTeX RDF |
Matrix interpretations, Satisfiability, Termination, Term rewriting |
| 1 | Adam Koprowski, Johannes Waldmann |
Arctic Termination ...Below Zero. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Moser, Andreas Schnabl, Johannes Waldmann |
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
On tree automata that certify termination of left-linear term rewriting systems. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Waldmann |
Weighted Automata for Proving Termination of String Rewriting. |
Journal of Automata, Languages and Combinatorics |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hans Zantema, Johannes Waldmann |
Termination by Quasi-periodic Interpretations. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Hofbauer, Johannes Waldmann |
Termination of {aa->bc, bb->ac, cc->ab}. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Hofbauer, Johannes Waldmann |
Termination of String Rewriting with Matrix Interpretations. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
Finding finite automata that certify termination of string rewriting systems. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. |
J. Autom. Reasoning |
2005 |
DBLP DOI BibTeX RDF |
match-bounded, inhibitor, termination, normalization, reachability, regular languages, context-free languages, semi-Thue systems, string rewriting systems |
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Hofbauer, Johannes Waldmann |
Deleting string rewriting systems preserve regularity. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Match-Bounded String Rewriting Systems. |
Appl. Algebra Eng. Commun. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Match-bounded, Termination, Semi-Thue System, String Rewriting System |
| 1 | Johannes Waldmann |
Matchbox: A Tool for Match-Bounded String Rewriting. |
RTA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
Finding Finite Automata That Certify Termination of String Rewriting. |
CIAA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Match-Bounded String Rewriting Systems. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Hofbauer, Johannes Waldmann |
Deleting String Rewriting Systems Preserve Regularity. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Waldmann |
Rewrite Games. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Johannes Waldmann |
Some Regular Languages That Are Church-Rosser Congruential. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Waldmann |
The Combinator S. |
Inf. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Waldmann |
Normalization of S-Terms is Decidable. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")