Yes, you can use a DFA to prove that trunc is regular.

• twoski
In summary, the conversation discusses the concept of truncating a regular language, L, to a specific length, n, and how this operation may affect the regularity of the language. The discussion raises concerns about the possibility of truncating to a length where the resulting string would not satisfy the constraints of the original language, but it is ultimately concluded that this is not a valid concern when considering the regularity of truncn(L). The use of a DFA is also proposed as a potential method for proving the regularity of truncn(L).
twoski

Homework Statement

Let truncn(L) = {w: wv exists in L, |v| = n}

Show that trunc is regular if L is regular.

The Attempt at a Solution

By the definition of regular languages, L is regular if we can come up with a regular expression or a DFA for it.

This question confuses me because what if we have a regular language L where the only string it produces is "aaa", and we take trunc8(L)? The string v can't exist if the length of wv is 3, but in this case we technically can since there are no constraints on n.

Anyone?

I think that the constraints of truncn(L) prohibit us from choosing n larger than |wv| so ignore that part of my initial post.

Can i use a DFA to prove trunc is regualr?

1. What is Regular Language Comparison?

Regular Language Comparison is a method used in computer science and linguistics to compare two or more languages based on their structural and grammatical patterns. It involves analyzing the similarities and differences in the rules and patterns used in each language.

2. Why is Regular Language Comparison important?

Regular Language Comparison allows us to better understand the relationships between different languages and to identify patterns and commonalities that may exist. It can also help in language classification and in identifying language families.

3. How is Regular Language Comparison performed?

Regular Language Comparison involves breaking down the languages into their basic components, such as phonemes, morphemes, and syntax, and comparing these components between languages. This can be done manually or with the use of computer programs.

4. What are the limitations of Regular Language Comparison?

Regular Language Comparison is limited in its ability to fully capture the complexities and nuances of language. It also does not take into account cultural and historical influences on language, which can greatly impact its development and evolution.

5. What are some applications of Regular Language Comparison?

Regular Language Comparison has various applications, including language classification, historical linguistics, and language preservation. It is also useful in machine translation and language learning, as it can help identify similarities and differences between languages.

• Engineering and Comp Sci Homework Help
Replies
1
Views
2K
• Engineering and Comp Sci Homework Help
Replies
1
Views
2K
• Engineering and Comp Sci Homework Help
Replies
1
Views
1K
• Engineering and Comp Sci Homework Help
Replies
1
Views
1K
• Set Theory, Logic, Probability, Statistics
Replies
18
Views
3K
• Engineering and Comp Sci Homework Help
Replies
1
Views
2K
• Engineering and Comp Sci Homework Help
Replies
1
Views
3K
• Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
• Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
• Set Theory, Logic, Probability, Statistics
Replies
5
Views
1K