Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: "136736556"
im Bestand: Gesamter Bestand

11 - 20 von 79

	11	For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide Kobayashi, Yuji. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2001
	12	On the power of RRWW automata Niemann, Gundula. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2001
	13	Shrinking alternating two-pushdown automata Otto, Friedrich. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2001
	14	Some results on Green's relations for monoids presented by monadic string rewriting systems Otto, Friedrich. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2001
	15	Confluent monadic string rewriting systems and automatic structures Otto, Friedrich. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2000
	16	A completion procedure for finitely presented groups that is based on word cycles Cremanns, Robert. - Kassel : Fachbereich 17 der GhK, 1998
	17	A survey on the computational power of some classes of finite monoid presentations Otto, Friedrich. - Kassel : GhK, Fachbereich Mathematik/Informatik, [1998]
	18	FP∞ is undecidable for finitely presented monoids with word problems decidable in polynomial time Cremanns, Robert. - Kassel : Fachbereich 17 der GhK, 1998
	19	On Dehn functions of finitely presented bi automatic monoids Otto, Friedrich. - Kassel : Fachbereich 17 der GhK, 1998
	20	On s-regular prefix rewriting systems and automatic structures Otto, Friedrich. - Kassel : Fachbereich 17 der GhK, 1998