Titlebook: Rewriting Techniques and Applications; 8th International Co Hubert Comon Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997

參考書目

On the word problem for free lattices,We prove completeness of a rewrite-based algorithm for the word problem in the variety of lattices and discuss the method of non-symmetric completion with regard to this variety.

羽飾

GRIEF

Clumsy

https://doi.org/10.1007/3-540-62950-5Automatisches Schlie?en; Constraint-Aufl?sung; Monoid; Stringersetzung; Termersetzung; Theorem-Beweisen; a

FLAIL

On the property of preserving regularity for string-rewriting systems, (1995). In particular, it is shown that it is undecidable in general whether a finite, length-reducing, and confluent stringre-writing system yields a regular set of normal forms for each regular language.

博識(shí)

D-bases for polynomial ideals over commutative noetherian rings,escribed at an abstract level, by transition rules. Its termination is proved under certain assumptions about the strategy that controls the application of the transition rules. Correctness is established by proof simplification techniques.

謙虛的人

JAMB

978-3-540-62950-4Springer-Verlag Berlin Heidelberg 1997

MEEK

粗鄙的人