Invariante Eigenschaften von Wortersetzungssystemen - Forschungsinformationssystem | Universität Kassel

ohne Drittmittelfinanzierung

Invariante Eigenschaften von Wortersetzungssystemen

Details zum Projekt

Projektlaufzeit: 09/2001–12/2004

Webseite: http://www.theory.informatik.uni-kassel.de/

Zusammenfassung

We focus on the following question:
(*) `Can one characterize the monoids that admit a finite convergent
rewriting system by means of a number of invariant properties?'
The properties FHT of finite homological type and FDT of finite
derivation type are examples of invariant properties that these
monoids satisfy. There are various possibilites for obtaining
analogues of these properties in higher dimensions. This is one line
of research we will pursue. It seems probable that a solution to (*)
(if there is one) will require some geometric and/or topological
input. We therefore regard it as important to investigate the higher
dimensional geometric aspects of rewriting systems.

Publikationen

2007	Otto, F., 2007. Relative monoid presentations and finite derivation type, in: Andre, J.M. (Hrsg.), Semigroups and Formal Languages, Proc. of the International Conference in Honour of the 65th Birthday of Donald B. McAlister. World Scientific, Singapore, S. 240–254.
2005	Pride, S., Otto, F., 2005. On higher order homological finiteness of rewriting systems. Journal of Pure and Applied Algebra 200, 149–161. https://doi.org/10.1016/j.jpaa.2004.12.035
2004	Pride, S., Otto, F., 2004. For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. The Journal of the London Mathematical Society 69, 363–382. https://doi.org/10.1112/S0024610703004903
2003	Pride, S., Otto, F., 2003. On higher order homological finiteness of rewriting systems. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2003	Pride, S., Otto, F., 2003. Relative monoid presentations and finite derivation type. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2002	Pride, S., Otto, F., 2002. For rewriting systems the topological finiteness conditions FDT, FHT are not equivalent.