Purchase Solution

languages of strings

Not what you're looking for?

Ask Custom Question

Write a regular expression describing the language of strings that have at least two 1's. The language consists of 0's and 1's.

Purchase this Solution

Solution Summary

Help with describing languages of strings is offered.

Solution Preview

We are looking for example strings like 011000110 and 00110000, but not 00100. It is possible to define a superset of the language by the ...

Purchase this Solution

Free BrainMass Quizzes
Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Basic Networking Questions

This quiz consists of some basic networking questions.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.