Dieter Hofbauer

Available identifiers

zbMath Open hofbauer.dieterMaRDI QIDQ199240

List of research outcomes

Publication	Date of Publication	Type
Computing linearizations using test sets	2023-03-09	Paper
Termination proofs and the length of derivations	2022-12-09	Paper
Time bounded rewrite systems and termination proofs by generalized embedding	2022-12-09	Paper
Termination proofs by multiset path orderings imply primitive recursive derivation lengths	2022-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q5089023	2022-07-18	Paper
Finding and Certifying Loops	2010-01-28	Paper
Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)	2010-01-18	Paper
Termination of String Rewriting with Matrix Interpretations	2008-09-25	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
On tree automata that certify termination of left-linear term rewriting systems	2007-04-16	Paper
Termination proofs for string rewriting systems via inverse match-bounds	2006-11-17	Paper
Term Rewriting and Applications	2005-11-11	Paper
Implementation and Application of Automata	2005-08-17	Paper
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS	2005-08-01	Paper
On state-alternating context-free grammars	2005-06-30	Paper
Match-bounded string rewriting systems	2005-02-09	Paper
Deleting string rewriting systems preserve regularity	2005-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q4452074	2004-02-11	Paper
An upper bound on the derivational complexity of Knuth-Bendix orderings.	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4790443	2003-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q2778874	2002-03-21	Paper
Test sets for the universal and existential closure of regular tree languages.	2002-01-01	Paper
Termination proofs for ground rewrite systems -- interpretations and derivational complexity	2001-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4511317	2001-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q4954448	2000-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q4938607	2000-02-23	Paper
Linearizing term rewriting systems using test sets	1994-09-12	Paper
https://portal.mardi4nfdi.de/entity/Q4693113	1993-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4023450	1993-01-23	Paper
Termination proofs by multiset path orderings imply primitive recursive derivation lengths	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q3490953	1989-01-01	Paper

Research outcomes over time

This page was built for person: Dieter Hofbauer