Finite automata - Samenvattingen, Aantekeningen en Examens

1. Create a DFA for some given languages and vice versa. 2. Find the transition function δ or transition table for a given DFA and vice versa. 3. Test either the given string is accepted or rejected based on a given DFA

Personal revision notes

TERMS: i. FSM: Finite State Machine (Lowest level machine, basic computations) ii. CFL: Context Free Language (Capable of a little higher level computations) iii. TM: Turing Machine (High Level Computations) iv. Undecidable: Problems that cannot be solved by any machine v. Symbol examples: a, b, c, 0, 1, 2, 3.... vi. Alphabet: denoted by 'sigma': collection of symbols eg. {a,b} or {d, e, f, g} or {0, 1, 2} vii. String: sequence of symbols eg.a,b,0, aa, bb, ab, 01 viii. Language: Set ...

Class notes for Theory of Computer Science, Computer Engineering (SEM V), covering important sums, solutions to questions from past papers, easy and complete methods to score full.

COS2601 Theoretical Computer Science II Example examination paper and solutions (a) Let S = {a bb bab abaab}. For each of the following strings, state whether or not it is a word in S*: (i) abbabaabab (ii) abaabbabbbaabb (2) (b) Give an example of a set S such that S* only contains all possible strings of combinations of a’s and b’s that have length divisible by three. (4) (c) Give an example of two sets S and T of strings such that S* = T* but S ⊄ T and T ⊄ S. (4) ANSWER TO QU...