List of top Computer Science & Information Technology Questions on Theory of Computations asked in TS PGECET

For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?

Moore machine is an example of

A language $L$ is said to be Turing machine (TM) decidable if

A Turing machine that is able to simulate other Turing machines is known as

Choose the correct option when
S1: Initial state of NFA is initial state of DFA
S2: The final state of DFA will be every combination of final set of NFA

Which of the following does not represent the language $\{0, 01\}$?

How many tuples are present in finite state machine?

According to the Chomsky classification, language of finite automata is

What is the regular expression for all strings starting with ab then any number of a or b and ending with bba?

The transition a pushdown automation made by is additionally dependent upon