Regular Tree Grammar - Definition

Definition

A regular tree grammar is defined by the tuple

,

where

  • is a set of nonterminals,
  • is a ranked alphabet (i.e., an alphabet whose symbols have an associated arity) disjoint from ,
  • is the starting nonterminal, with, and
  • is a set of productions of the form, where, and, where is the associated term algebra, i.e. the set of all trees composed from symbols in according to their arities, where nonterminals are considered nullary.

Read more about this topic:  Regular Tree Grammar

Famous quotes containing the word definition:

    According to our social pyramid, all men who feel displaced racially, culturally, and/or because of economic hardships will turn on those whom they feel they can order and humiliate, usually women, children, and animals—just as they have been ordered and humiliated by those privileged few who are in power. However, this definition does not explain why there are privileged men who behave this way toward women.
    Ana Castillo (b. 1953)

    Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.
    Nadine Gordimer (b. 1923)

    It is very hard to give a just definition of love. The most we can say of it is this: that in the soul, it is a desire to rule; in the spirit, it is a sympathy; and in the body, it is but a hidden and subtle desire to possess—after many mysteries—what one loves.
    François, Duc De La Rochefoucauld (1613–1680)