Adaptive Machine Formalisms
The formalisms listed below, while not grammar formalisms, either serve as the basis of full grammar formalisms, or are included here because they are adaptive in nature. They are listed in their historical order of first mention in the literature.
- Self-Modifying Finite State Automata (Shutt & Rubinstein)
- Introduced in 1994 by Shutt and Rubinstein, Self-Modifying Finite State Automata (SMFAs) are shown to be, in a restricted form, Turing powerful.
- Adaptive Automata (Neto)
- In 1994, Neto introduced the machine he called a structured pushdown automaton, the core of adaptive automata theory as pursued by Iwai, Pistori, Bravo and others. This formalism allows for the operations of inspection (similar to syntactic predicates, as noted above relating to Iwai's adaptive grammars), addition, and deletion of rules.
Read more about this topic: Adaptive Grammar, Adaptive Formalisms in The Literature
Famous quotes containing the words adaptive and/or machine:
“The shift from the perception of the child as innocent to the perception of the child as competent has greatly increased the demands on contemporary children for maturity, for participating in competitive sports, for early academic achievement, and for protecting themselves against adults who might do them harm. While children might be able to cope with any one of those demands taken singly, taken together they often exceed children’s adaptive capacity.”
—David Elkind (20th century)
“He is no more than the chief officer of the people, appointed by the laws, and circumscribed with definite powers, to assist in working the great machine of government erected for their use, and consequently subject to their superintendence.”
—Thomas Jefferson (1743–1826)