Request: True or False for the items listed below. a) The language of all string

Question

Request: True or False for the items listed below. a) The language of all strings with a different number of a's and b's is regular. b) The language of all palindromes with exactly 100 characters is regular. c) Any nondeterministic pushdown stack automaton can be converted into a deterministic pushdown stack automaton. d) Any nondeterministic pushdown stack automaton can be converted into a Turing machine. e) It is theoretically possible to create a Turing machine to calculate the ten-digit approximation of the squareroot of any whole number between 1 and 10.

Explanation / Answer

A) TRUE

Because the language doesn't depends on the count of the charecters

B) FALSE

BECAUSE ALL PALINDROMES THAT COMES UNDER INFINITE LANGUAGES

C) False

Not every nondeterministic push down but for some of them exactly equivalent deterministic push down stack

D) false

E) True

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.