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.

View More Free Quizzes
Related BrainMass Solutions

  • Differences between Java and other languages

    Cmm languages Handling of text strings is one good example of how Java and Cmm differ--an example that illustrates how the different Java and Cmm paths taken for modifying C can lead to very different code.

  • Visual Basic .NET different from any other programming language

    / GUI o VISUAL BASIC o C++ FOURTH GENERATION LANGUAGES · NON-PROCEDURAL LANGUAGE o USER SPECIFIES WHAT IS TO BE DONE o NOT HOW IT IS TO BE ACCOMPLISHED · DIVERSE TYPES OF 4GLs o SPREADSHEET LANGUAGES o DATABASE QUERY LANGUAGES o DECISION

  • Automata and Computability

    Let D be a DFA of A and F be the set of final states in D. First we note that all strings in NOEXTEND(A) are strings in A. Let . w is not in NOEXTEND(A) if and there exists a non-empty string x such that .

  • Automata and Computability

    Solution: => Let D() test whether y is an accepting computational history of C(x). <= Let C(x) simulate D() for y1, y2, y3, . . . (lexicographic ordering of strings), until D() accepts, and then C(x) accepts.

  • LISP as dominant in the field of Artifical Intelligence

    Symbols differ from strings in that you can test equality by comparing a pointer. 8. A notation for code using trees of symbols. 9. The whole language always available. There is no real distinction between read-time, compile-time, and runtime.

  • Arrays

    As with any other data types, arrays can store integers, floats, doubles, strings, chars, or objects in them (in case of OOP languages) and are created in the same manner as other variable types, though many languages have their own syntax and keywords

  • Prolog does not conform to a strict logic model







    The Merits of Declarative Languages

    The use of declarative languages offers three important advantages.

  • Discussing Variables and Constants

    - string: This is found in high level languages and allows strings of characters and literals to be stored in an abstract variable of arbitrary size. An example of a string is "Hello World!".

  • Set Partitions and Bit Strings

    a) The set of bit strings that end with 00; the set of bit strings that end with 01; the set of bit strings that end with 10; and the set of bit strings that end with 11.

View More Related Solutions