View this PageEdit this PageAttachments to this PageHistory of this PageHomeRecent ChangesSearch the SwikiHelp Guide

Slovníček zkratek

Zkratka Význam
RE Recursively Enumerable (languages)
CS Context Sensitive (languages)
CF, CFL Context Free (languages)
REG Regular (languages)
LIN Linear (languages, productions have only 1 nonterm in right handle)
FIN FINite (languages)

CFG Context-Free Grammar
TM, TS Turing Machine
LBA Linear Bounded Machine
PDA PushDown Automata
FA Finite Automate

PL(X) Pumping Lemma for X languages

CF(X) Context-Free Grammar regulated by language from class X,
PS: Programmable Grammars has X = REG)
RPDA(X) Regulated Pushdown Automata by language from class X


Link to this Page