Unrestricted and context-free grammars {Backus-Naur form grammar} allow symbol replacement with symbols or letters.
Previous input and output can have no affect on output {context-free grammar}. Only current state determines output.
Current state and previous input and output can determine output {context-sensitive grammar}.
Input string and current state can determine output {finite state machine}.
Previous input can determine output, with no need to go backward or forward to find context or current state {linear grammar}.
Previous input about sentence and input string can determine output, with no need to go backward or forward to find context or current state {regular grammar}.
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0225