Register

Regular languages properties

585 views
0 votes
0 votes
Are regular languages closed under inverse substitution?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Savvy asked Jun 6, 2018
335 views
Introduction to Automata Theory- Properties of regular Languages - Q 4.2.10
Suppose that L is any language , not necessarily regular, whose alphabet is {0}; that is the strings of L consist of 0's only. Prove that L* is regular.
Suppose that L is any language , not necessarily regular, whose alphabet is {0}; that is the strings of L consist of 0's only. Prove that L* is regular.
User Avatar
1 votes
1 votes
1 answer
2
vaishali jhalani asked Dec 14, 2016
785 views
regular languages closure properties
What is difference between Kleene closure and infinite union in context of regular languages?
What is difference between Kleene closure and infinite union in context of regular languages?
User Avatar
0 votes
0 votes
1 answer
4
UltraRadiantX asked Oct 9, 2021
466 views
Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL? Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its complement can never be RE.
let L = “CFL but not REGULAR”, Can we get complement of L as CFL?Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, it...
User Avatar
Link Copied!