Area of a circle each polygon side is a radius, of length "r". And since the total side length is greater than the circumference, the polygon consists of "n" identical triangles with total area greater than "T". Again we have a contradiction, so our supposition that "C" might be less than "T" must be wrong as well. Therefore, it must be the case that the area enclosed by the circle is precisely the same as the area of the triangle. This concludes the proof. Following Satō Moshun and Leonardo da Vinci , we can use inscribed regular polygons in a different way. Suppose we
Straight-line grammar minimal size that generates a given string is called the smallest grammar problem. Straight-line grammars (more precisely: straight-line context-free string grammars) can be generalized to "Straight-line context-free tree grammars". The latter can be used conveniently to compress trees. A context-free grammar "G" is an SLG if: 1. for every non-terminal "N", there is at most one production rule that has "N" as its left-hand side, and 2. the directed graph "G"=<"V","E">, defined by "V" being the set of non-terminals and ("A","B") ∈ "E" whenever "B" appears at the right-hand side of a production rule for "A", is acyclic. A mathematical