Math, asked by veenajetpuriya4630, 1 year ago

Are all languages on dfas/regular languages decidable?

Answers

Answered by hritik123roy

Answer:

. Every regular language is Turing-decidable and therefore Turing acceptable / recognisable (but note that Turing acceptable does not imply Turing decidable).

Previous Question

Next Question

Similar questions

Math, 6 months ago

How many sides does a regular polygon have, wherein, whose interior angle is eight times its exterior angle...

Math, 6 months ago

Name the triangle Which the two altitudes of Triangle Are two of it sides...

Math, 6 months ago

radius of a circle with centre is 8 cm point p and q are such that po =5cm and qo =11cm state which of points p and q is in the interior and exterior of the circle...

Chemistry, 1 year ago

The aqueous solution having ph 2 is how many times more acidic than aqueous solution having ph4...

Physics, 1 year ago

A particle of mass m/10 strikes the block of mass m...

History, 1 year ago

When indo pak war was fought?

History, 1 year ago

why was sirajuddawlah so easily defeated by the British???

Science, 1 year ago

☯️☯️☯️☯️☯️ Is there any place possible in space where there is zero gravity? Answers from serious users and cosmos lovers➡️➡️ ☯️☯️☯️☯️☯️...