thechomskyhierarchyfourcomputers(編輯修改稿)
2024-11-29 17:03 本頁面
【文章內(nèi)容簡介】 X? sY S = {a,b} X? s N = {S} X? l R = {S ? aSb, S ? l} ? Uses a stack to hold infinite memory ContextSensitive Languages ? The number of symbols on the LHS must not exceed the number of symbols on the RHS ? A ? l is not allowed unless A is the start symbol and does not occur on the RHS of any rule ? Since we allow more than one symbol on the LHS, we refer to those symbols other than the one we are replacing as the context of the replacement. ? Linearbounded automaton: a Turing Machine with a finite amount of tape ? The syntax of some natural languages (including Dutch, and Swiss German) is held to have structures of this type Recursively Enumerable ? Have no restrictions on their grammar rules (except, of course, that there must be at le
教學課件相關推薦
鄂ICP備17016276號-1