default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Hofbauer
Person information
- affiliation: University of Kassel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Dieter Hofbauer, Johannes Waldmann:
Old and New Benchmarks for Relative Termination of String Rewrite Systems. CoRR abs/2307.14149 (2023)- [i2]Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet:
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. CoRR abs/2308.09536 (2023) - 2020
- [i1]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling through Overlap Closures for Termination of String Rewriting. CoRR abs/2003.01696 (2020)
2010 – 2019
- 2019
- [c16]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. FSCD 2019: 21:1-21:21 - 2010
- [c15]Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
:
Finding and Certifying Loops. SOFSEM 2010: 755-766
2000 – 2009
- 2007
- [j12]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205(4): 512-534 (2007) - 2006
- [j11]Dieter Hofbauer, Johannes Waldmann:
Termination of {aa->bc, bb->ac, cc->ab}. Inf. Process. Lett. 98(4): 156-158 (2006) - [c14]Dieter Hofbauer, Johannes Waldmann:
Termination of String Rewriting with Matrix Interpretations. RTA 2006: 328-342 - 2005
- [j10]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16(3): 471-486 (2005) - [j9]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reason. 34(4): 365-385 (2005) - [j8]Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto:
On state-alternating context-free grammars. Theor. Comput. Sci. 337(1-3): 183-216 (2005) - [c13]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367 - 2004
- [j7]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004) - [j6]Dieter Hofbauer, Johannes Waldmann:
Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3): 301-317 (2004) - [c12]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145 - 2003
- [j5]Dieter Hofbauer:
An upper bound on the derivational complexity of Knuth-Bendix orderings. Inf. Comput. 183(1): 43-56 (2003) - [c11]Dieter Hofbauer, Johannes Waldmann:
Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348 - [c10]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems. MFCS 2003: 449-459 - 2002
- [j4]Dieter Hofbauer, Maria Huber:
Test Sets for the Universal and Existential Closure of Regular Tree Languages. Inf. Comput. 178(2): 465-498 (2002) - 2001
- [j3]Dieter Hofbauer:
Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity. Appl. Algebra Eng. Commun. Comput. 12(1/2): 21-38 (2001) - [c9]Dieter Hofbauer:
Termination Proofs by Context-Dependent Interpretations. RTA 2001: 108-121
1990 – 1999
- 1999
- [c8]Dieter Hofbauer, Maria Huber:
Test Sets for the Universal and Existential Closure of Regular Tree Languages. RTA 1999: 205-219 - 1994
- [j2]Dieter Hofbauer, Maria Huber:
Linearizing Term Rewriting Systems Using Test Sets. J. Symb. Comput. 17(1): 91-129 (1994) - [c7]Dieter Hofbauer, Maria Huber, Gregory Kucherov:
Some Results on Top-Context-Free Tree Languages. CAAP 1994: 157-171 - 1992
- [b2]Dieter Hofbauer:
Termination proofs and derivation lengths in term rewriting systems. Technical University of Berlin, Germany, 1992 - [j1]Dieter Hofbauer:
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. Theor. Comput. Sci. 105(1): 129-140 (1992) - [c6]Dieter Hofbauer, Maria Huber:
Computing Linearizations Using Test Sets. CTRS 1992: 287-301 - 1991
- [c5]Dieter Hofbauer:
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. RTA 1991: 62-73 - 1990
- [c4]Dieter Hofbauer:
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. ALP 1990: 347-358
1980 – 1989
- 1989
- [b1]Dieter Hofbauer, Ralf-Detlef Kutsche:
Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und Mathematiker. Vieweg 1989, ISBN 978-3-528-04718-4, pp. I-VIII, 1-172 - [c3]Dieter Hofbauer, Clemens Lautemann:
Termination Proofs and the Length of Derivations (Preliminary Version). RTA 1989: 167-177 - 1988
- [c2]Dieter Hofbauer, Ralf-Detlef Kutsche:
Proving Inductive Theorems in Equational Theories. ADT 1988 - [c1]Dieter Hofbauer, Ralf-Detlef Kutsche:
Proving Inductive Theorems Based on Term Rewriting Systems. ALP 1988: 180-190
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
