The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
17 views
We define the $\text{avoids}$ operation for languages $A$ and $B$ to be $\text{A avoids B = {w| w ∈ A and w doesn’t contain any string in B as a substring}.}$ Prove that the class of regular languages is closed under the ${avoids}$ operation.
in Theory of Computation by Boss (46.6k points) | 17 views

1 Answer

0 votes
don't you think that it is kind of related to Quotient(A/B) ?
by (23 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,896 questions
55,153 answers
190,576 comments
85,317 users