The Gateway to Computer Science Excellence
0 votes

For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alphabet $Σ = \{a,b\}$ in all parts.

  1. $a^{*}b^{*}$
  2. $a(ba)^{*}b$
  3. $a^{*}\cup b^{*}$
  4. $(aaa)^{*}$
  5. $\sum^{*}a\sum^{*}b\sum^{*}a\sum^{*}$
  6. $aba\cup bab$
  7. $(\epsilon\cup a)b$
  8. $(a\cup ba\cup bb)\sum^{*}$
in Theory of Computation by Veteran (58.9k points) | 52 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,737 questions
57,313 answers
105,051 users