The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
48 views

Let $M_{1}$ and $M_{2}$ be $\text{DFA's}$ that have $k_{1}$ and $k_{2}$ states, respectively, and then let $U = L(M_{1})\cup L(M_{2}).$

  1. Show that if $U\neq\phi$ then $U$ contains some string $s,$ where $|s| < max(k1, k2).$
  2. Show that if $U\neq\sum^{*},$ then $U$ excludes some string $s,$ where $|s| < k1k2.$
in Theory of Computation by Veteran (51.1k points) | 48 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,339 questions
55,765 answers
192,355 comments
90,816 users