Encyclopedia.com > Dictionaries, Thesauruses, Pictures, and Press Releases > A Dictionary of Computing > January 2004

derivation sequence

A Dictionary of Computing | 2004 | 396 words | Copyright

derivation sequence In formal language theory, a sequence of words of the form w1 ⇒ w2 ⇒ … ⇒ wn

(for notation see semi-Thue system). For a context-free grammar, such a sequence is leftmost (or rightmost) if, for each 1←i←n,

wi+1 is obtained from wi by rewriting the leftmost (or rightmost) nonterminal in wi. Such sequences exist for all derivable words.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "derivation sequence." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "derivation sequence." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-derivationsequence.html

JOHN DAINTITH. "derivation sequence." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-derivationsequence.html

Learn more about citation styles

Find thousands of answers for hundreds of subjects at Answers Encyclopedia .

All answers verified by trusted sources at Encyclopedia.com

Try Answers Encyclopedia now!

For students and teachers!

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including:

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including: