0
13kviews
State and explain decision properties of regular languages

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: Dec 2016

1 Answer
1
685views

The decision algorithm for regular sets requires the following points to be remembered:

a. An algorithm must always terminated to be called an algorithm. Basically, an algorithm needs to have the following four characteristics:

i. An algorithm must be written using a finite number of unambiguous steps.

ii. For every …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.