CSE 355: Automata Theory and Computability

What is the weightage of quizzes in the grading for CSE 355?

40% - Two midterms (20% each)
30% - Final, cumulative
15% - 5-6 assignments
15% - 10 to 12 quizzes (lowest 2 to be dropped) (correct)

Which branch of computer science theory is studied in CSE 355?

Automata theory or language theory (correct)
Data structures
Databases
Computability

What does the term 'computability' refer to in the context of CSE 355?

The ability to solve problems faster
Efficiency of the solution
The ability to compute, irrespective of solution efficiency (correct)
The ability to solve more problems

What are regular expressions used for in CSE 355?

String matching, keyword/pattern matching (C) Signup and view all the answers

What is the purpose of finite automata in CSE 355?

Used for implementing REs (B) Signup and view all the answers

How do stronger computers differ from weaker ones according to the text?

They can solve the same problems faster, or more of them (B) Signup and view all the answers

What is the central question of complexity theory?

To classify problems as easy or hard (C) Signup and view all the answers

In complexity theory, what is the objective related to problems?

To classify problems as easy or hard (D) Signup and view all the answers

What type of computation is considered in the context of complex problems?

Randomized computation (B) Signup and view all the answers

What does complexity theory attempt to determine about problems?

If they are actually solvable (A) Signup and view all the answers

What is the main application of complexity theory in cryptography?

Classifying problems as easy or hard (D) Signup and view all the answers

What is the purpose of power set of A in set theory?

Set of all subsets of A (C) Signup and view all the answers

What is the characteristic of lexicographic order?

It arranges symbols based on their appearance in an alphabet (A) Signup and view all the answers

What does proof by induction involve?

Proving that a statement is true for infinite cases (C) Signup and view all the answers

What is the main application of finite automatas?

Text processing (A) Signup and view all the answers

In graph theory, what type of connection has directionality?

Directed connections (C) Signup and view all the answers

In the context of deterministic finite state machines (DFAs), which of the following best describes the role of the alphabet?

The alphabet is a set of strings that represent the input symbols (B) Signup and view all the answers

According to the information provided, what is the difference between the two machines M1 and M2?

M1 and M2 have different language definitions (A) Signup and view all the answers

In the context of deterministic finite state machines, what does it mean for a state to have an outgoing arrow for every string in an alphabet?

It means that the state has a transition for every possible combination of input symbols (C) Signup and view all the answers

What is the language of the machine M1 based on the provided information?

{any input that ends with one} (B) Signup and view all the answers

According to the text, what is the significance of states in deterministic finite state machines?

States act as memory elements within the machine (D) Signup and view all the answers

What is the relationship between the two machines M1 and M2 based on the information provided?

The two machines are complements of each other (D) Signup and view all the answers

In the context of finite automata, what is the formal definition of 'accepting' computation?

The machine accepts a string if there is a sequence of states r0, r1, r2, … rn in Q with the condition r0=q0, rn∈F, and each transition is a valid move according to the transition function delta (A) Signup and view all the answers

What is the language recognized by machine M5 based on the provided information?

{ w | sum of the symbols in w is a multiple of 3 } (D) Signup and view all the answers

What does it mean for a language to be called a regular language?

It means that some finite automaton recognizes it (B) Signup and view all the answers

What are the conditions for accepting a string by a finite automaton?

The first state visited must be the start state, the end state must be in the accepting set, and each transition must be a valid move according to the transition function delta (B) Signup and view all the answers

What is the defining characteristic of regular languages?

They can be recognized by both deterministic and non-deterministic finite automata (D) Signup and view all the answers

What is the function of Q0 in the context of generalized automaton Bi?

Q0 is the state when mod i is 0 (A) Signup and view all the answers

What is the significance of the original and new transition table sizes in generalized automaton Bi?

The original transition table is 3x4, and the new transition table would be i x 4, where i represents the number of states (D) Signup and view all the answers

What does L(M) = A signify in the context of finite automata?

(M) represents the set of strings where M accepts A, based on specific conditions defined in A (D) Signup and view all the answers

What does proof by induction involve according to the text?

It involves proving a statement for an arbitrary natural number using specific steps and base cases (B) Signup and view all the answers