The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
  1. Let $A$ be an infinite regular language. Prove that $A$ can be split into two infinite disjoint regular subsets.
  2. Let $B$ and $D$ be two languages. Write $B\subseteqq D$ if $B\subseteq D$ and $D$ contains infinitely many strings that are not in $B.$ Show that if $B$ and $D$ are two regular languages where $B\subseteqq D,$ then we can find a regular language $C$ where $B\subseteqq C\subseteqq D.$
in Theory of Computation by Boss (47.9k points) | 8 views

Please log in or register to answer this question.

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
50,092 questions
55,322 answers
86,225 users