Processes {Post grammar} can replace input string with output string of same or different length. In simple Post grammars, short input strings have output strings listed in a lookup table {grammar table}. Complex Post grammars have long input and output strings, and rules determine output string substituted for input string. Rules are input strings. Rules can select input strings or string sequences. Rules can select or substitute strings deterministically or probabilistically. Post grammars can be equivalent to Turing machines and lambda calculi.
Mathematical Sciences>Computer Science>Systems
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224