Dieter Hofbauer

From MaRDI portal
Revision as of 21:04, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:199240

Available identifiers

zbMath Open hofbauer.dieterMaRDI QIDQ199240

List of research outcomes

PublicationDate of PublicationType
Computing linearizations using test sets2023-03-09Paper
Termination proofs and the length of derivations2022-12-09Paper
Time bounded rewrite systems and termination proofs by generalized embedding2022-12-09Paper
Termination proofs by multiset path orderings imply primitive recursive derivation lengths2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50890232022-07-18Paper
Finding and Certifying Loops2010-01-28Paper
Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)2010-01-18Paper
Termination of String Rewriting with Matrix Interpretations2008-09-25Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
On tree automata that certify termination of left-linear term rewriting systems2007-04-16Paper
Termination proofs for string rewriting systems via inverse match-bounds2006-11-17Paper
Term Rewriting and Applications2005-11-11Paper
Implementation and Application of Automata2005-08-17Paper
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS2005-08-01Paper
On state-alternating context-free grammars2005-06-30Paper
Match-bounded string rewriting systems2005-02-09Paper
Deleting string rewriting systems preserve regularity2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44520742004-02-11Paper
An upper bound on the derivational complexity of Knuth-Bendix orderings.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47904432003-05-22Paper
https://portal.mardi4nfdi.de/entity/Q27788742002-03-21Paper
Test sets for the universal and existential closure of regular tree languages.2002-01-01Paper
Termination proofs for ground rewrite systems -- interpretations and derivational complexity2001-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45113172001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49544482000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49386072000-02-23Paper
Linearizing term rewriting systems using test sets1994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q46931131993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40234501993-01-23Paper
Termination proofs by multiset path orderings imply primitive recursive derivation lengths1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q34909531989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dieter Hofbauer