UGC NET COMPUTER SCIENCE SCORE BOOSTER FACTS FOR 2020
Topic:Discrete structures.
1. The properties of ordered set(POSET) are reflexive anti-symmetric and transitive.
2. Turing machines help to compute context free languages and also languages that
cannot be found by pushdown automata.
3.Finite automata is used for pattern matching in text editors in lexical analysis.
4. Pushdown automata is finite automata using stack. it is related to context free grammar type 2
5. Deterministic pushdown automata without stack is non deterministic finite automata.
6. Deterministic finite automata has unique next state.
7. Non deterministic finite automata has multiple next states.
8. A formal grammar has terminals, non terminals, production, start symbols.
9. chomsky hierarchy :
Type 0- recursively enumerable-Turing machine
type 1-context sensitive-linear bounded non deterministic turing machine
type 2-context free-non deterministic pushdown automaton
type 3-regular-finite state automaton
10. self loop-edge having same vertex.
Topic:Discrete structures.
1. The properties of ordered set(POSET) are reflexive anti-symmetric and transitive.
2. Turing machines help to compute context free languages and also languages that
cannot be found by pushdown automata.
3.Finite automata is used for pattern matching in text editors in lexical analysis.
4. Pushdown automata is finite automata using stack. it is related to context free grammar type 2
5. Deterministic pushdown automata without stack is non deterministic finite automata.
6. Deterministic finite automata has unique next state.
7. Non deterministic finite automata has multiple next states.
8. A formal grammar has terminals, non terminals, production, start symbols.
9. chomsky hierarchy :
Type 0- recursively enumerable-Turing machine
type 1-context sensitive-linear bounded non deterministic turing machine
type 2-context free-non deterministic pushdown automaton
type 3-regular-finite state automaton
10. self loop-edge having same vertex.
No comments:
Post a Comment