Nagarjuna B - Academia.edu (original) (raw)
Papers by Nagarjuna B
Computability : Models of computation-Finite Automata, Pushdown Automata, Non – determinism and N... more Computability : Models of computation-Finite Automata, Pushdown Automata, Non – determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non – computability and Examples of non – computable problems.
Computability : Models of computation-Finite Automata, Pushdown Automata, Non – determinism and N... more Computability : Models of computation-Finite Automata, Pushdown Automata, Non – determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non – computability and Examples of non – computable problems.