Difference between revisions of "Normal form (abstract rewriting)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
(One intermediate revision by the same user not shown) | |||
Line 6: | Line 6: | ||
* [[Abstract rewriting system]] | * [[Abstract rewriting system]] | ||
+ | * [[Computer science]] | ||
* [[Expression (computer science)]] | * [[Expression (computer science)]] | ||
* [[Newman's lemma]] | * [[Newman's lemma]] | ||
Line 13: | Line 14: | ||
* [https://en.wikipedia.org/wiki/Normal_form_(abstract_rewriting) Normal form (abstract rewriting)] @ Wikipedia | * [https://en.wikipedia.org/wiki/Normal_form_(abstract_rewriting) Normal form (abstract rewriting)] @ Wikipedia | ||
+ | |||
+ | [[Category:Computation]] | ||
+ | [[Category:Computer science]] |
Latest revision as of 18:56, 15 April 2016
In abstract rewriting, an object is in normal form if it cannot be rewritten any further.
Depending on the rewriting system and the object, several normal forms may exist, or none at all.
See also
- Abstract rewriting system
- Computer science
- Expression (computer science)
- Newman's lemma
- Object (computer science)
External links
- Normal form (abstract rewriting) @ Wikipedia