O'Reilly logo

Formal Languages and Automata Theory by K.V.N. Sunitha

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

List of Important Abbreviations

URG

Unrestricted Grammar

CSG

Context Sensitive Grammar

CFG

Context Free Grammar

RG

Regular Grammar

RL

Regular Language

CFL

Context Free Language

CSL

Context Sensitive Language

REL

Recursively Enumerable Language

CPU

Central Processing Unit

FA

Finite Automata

NFA

Non-deterministic Finite Automata

DFA

Deterministic Finite Automata

FSM

Finite State Machine

LMD

Left-most Derivation

RMD

Right-most Derivation

ID

Instantaneous Description

CNF

Chomsky Normal Form

GNF

Greibach Normal Form

RHS

Right-hand Side

LHS

Left-hand Side

CYK

Cocke–Younger–Kasami

PDA

Pushdown Automata

LBA

Linear-bound Automata

TM

Turing Machine

LIFO

Last-in-first-out

NPDA

Non-deterministic Pushdown ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required