Decision Properties of Languages

Click For Summary

Discussion Overview

The discussion revolves around the decision properties of various types of languages, including Regular, Context-Free, and Recursively Enumerable languages. Participants are examining a table created by one user that outlines these properties and seeking clarification on the accuracy of the entries and the meanings of specific terms and acronyms.

Discussion Character

  • Exploratory, Technical explanation, Conceptual clarification

Main Points Raised

  • One participant shares a table of decision properties for languages and asks for verification of its accuracy.
  • Another participant expresses uncertainty about their expertise in the topic and requests clarification on several acronyms used in the table, including RL, DCFL, CFL, CSL, and RE.
  • A later reply provides definitions for the acronyms: RL as Regular Languages, DCFL as Deterministic Context-Free Languages, CFL as Context-Free Languages, CSL as Context-Sensitive Languages, and RE as Recursively Enumerable Languages.
  • Further explanations are provided regarding the columns in the table, including what is meant by membership, emptiness tests, infiniteness, equality of languages, and subset relations.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the accuracy of the table, as the initial request for verification remains unanswered. There is a general acknowledgment of the need for clarification, but no agreement on specific entries or properties is established.

Contextual Notes

Some terms and concepts remain undefined or unclear, such as the meanings of certain columns in the table and the implications of the notation used. The discussion highlights a lack of expertise among participants regarding the specific decision properties of languages.

Who May Find This Useful

Individuals interested in formal languages, automata theory, and decision problems in computational theory may find this discussion relevant.

22990atinesh said:
I'd trouble remembering decision properties of languages like Regular, CFL, RE, etc. So I made a table of it. Are all the entries of table correct or has some errors

[/PLAIN]
Decision_Property.jpg
I don't think that we have much expertise in this somewhat esoteric area, which is probably why no one has responded.

You could help us out, though, but expanding the acronyms in your table.
RL = ?
DCFL = ?
CFL = ? (context-free language?)
CSL = ?
RE = ?

What does "Is L = ##\Phi ?## mean?
What do the other columns in the table mean?
What are L1 and L2?
 
Last edited by a moderator:
Mark44 said:
I don't think that we have much expertise in this somewhat esoteric area, which is probably why no one has responded.

You could help us out, though, but expanding the acronyms in your table.
RL = ?
DCFL = ?
CFL = ? (context-free language?)
CSL = ?
RE = ?

What does "Is L = ##\Phi ?## mean?
What do the other columns in the table mean?
What are L1 and L2?
Here
RL=Regular Languages
DCFL=Deterministic Context Free Languages
CFL=Context Free Languages
CSL=Context Sensitive Languages
RE=Recursively Enumerable Languages

##1^{st}## Column "Membership" corresponding to a particular row says that, is it decidable that a given string belong to a given language.

##2^{nd}## Column "##L=\phi##" corresponding to a particular row says that, is it decidable that a given language empty or not "i.e Emptiness Test".

##3^{rd}## Column "##L=\sum##*" corresponding to a particular row says that, is it decidable that a given language infinite.

##4^{th}## Column "Is ##L_1=L_2##" corresponding to a particular row says that, is it decidable that a given languages ##L_1, L_2## are equal.

##5^{th}## Column "Is ##L_1 \subset L_2##" corresponding to a particular row says, is it decidable that a given language ##L_1## a subset of another given language ##L_2##.
 
Thank you. Your question deals with things I don't know much about, but maybe the clarifications will help others to provide you with some insight.
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
4K
Replies
2
Views
1K
  • · Replies 44 ·
2
Replies
44
Views
6K
Replies
29
Views
6K
  • · Replies 40 ·
2
Replies
40
Views
9K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
Replies
15
Views
3K