COMPUTER SCIENCE AND APPLICATIONS - Sakshi · Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars. Languages—types
Post on 12-May-2020
12 Views
Preview:
Transcript
1
ANDHRA PRADESH STATE ELIGIBILITY TEST (APSET) – 2013
Code No: 04
Subject: COMPUTER SCIENCE AND APPLICATIONS
PAPER – II & III
SYLLABUS
PAPER - II
2
3
4
5
6
7
8
9
10
top related