seheory

Question 1

is the mathematical theory of a simple class of algorithms that are important in mathematics and computer science.

Answer 1

theory of finite automata

Question 2

deals with the logic of Computation with respect to simple machines, referred to

Answer 2

AUTOMATA.

Question 3

group of “objects

Answer 3

set

Question 4

Set that contains no elements is call empty or null set.

Answer 4

rue

Question 5

The number of elements in a set is its size or cardinality

Answer 5

rue

Question 6

sets contains all the elements in EITHER set

Answer 6

UNION

Question 7

sets contains all the elements in BOTH sets

Answer 7

INTERSECTION

Question 8

they have NO elements in common

Answer 8

disjoint

Question 9

is the elements in one set that are NOT in the other

Answer 9

difference

Question 10

contains all the elements in either set but NOT both

Answer 10

symmetric difference

Question 11

is all the elements that are NOT in the set

Answer 11

complement of a set

Question 12

a finite set of states

Answer 12

Q

Question 13

a finite set of symols

Answer 13

E

Question 14

a transition function that takes as argument a state and a symol and returns a state

Answer 14

&

Question 15

start state

Answer 15

q0

Question 16

a set of final or accepting state

Answer 16

F