Crowdly

Add to Chrome

Universities
online.upr.edu
LENGUAJES FORMALES Y AUTOMATA

LENGUAJES FORMALES Y AUTOMATA

Looking for LENGUAJES FORMALES Y AUTOMATA test answers and solutions? Browse our comprehensive collection of verified answers for LENGUAJES FORMALES Y AUTOMATA at online.upr.edu.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Given the following automaton

none

which of the following regular expressions is equivalent to the automata

$( a b \circ a )$ ( a b \circ a )

$( a b \cup a )^*$ ( a b \cup a )^*

$( a b \cup a )$ ( a b \cup a )

( a b )^*

View this question

$E_{TM}$ E_{TM} ={⟨M⟩|M is a TM and L(M)=∅ } is decidable

True

False

View this question

Computation histories are infinite sequences of configurations.

If one problem is mapping reducible to a second, previously solved problem, we can thereby obtain a solution to the original problem.

Deterministic machines have at most one computation history on any given input.

True

False

View this question

A is reducible to B if and only if B is reducible to A

$A_{LBA}$ A_{LBA} = {⟨M, w⟩| M is an LBA that accepts string w} is undecidable.

If A is reducible to B and B is decidable then A is decidable

The decidability of $A_{TM}$ A_{TM} can be proved by contradiction.

A linear bounded automaton is a Turing machine with a unlimited amount of memory

True

False

View this question

Want instant access to all verified answers on online.upr.edu?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome

Telegram Instagram TikTok Question Bank

Add to Chrome