Explain the alphabet and string, Operating System

Assignment Help:

Explain the Alphabet and String

A finite set of symbols is known as alphabet. An alphabet is frequently denoted by sigma, yet can be given any name.

B = {0, 1} says B is an alphabet of two symbols, 0 and 1.

C = {a, b, c} says C is an alphabet of three symbols, a, b and c.

Occasionally space and comma are in an alphabet whereas other times they are meta symbols employed for descriptions. A language is determined over an alphabet. For instance binary language is defined over alphabet B. 

A finite sequence of symbols from an alphabet is known as string or word.

01110 and 111 are strings from the alphabet B above.

aaabccc and b are strings from the alphabet C above.

A null string is a string along with no symbols, generally denoted by epsilon has zero length.

 

 


Related Discussions:- Explain the alphabet and string

What are the steps followed in testing, What are the steps followed in test...

What are the steps followed in testing? i. Unit testing - The individual components are tested in this type of testing. ii. Module testing - Related collection of independen

How is the NTFS namespace planned, Q. How is the NTFS namespace planned? Ex...

Q. How is the NTFS namespace planned? Explain. Answer: The NTFS namespace is prearranged as a hierarchy of directories where every directory uses a B+ tree data structure to

Unix and linux commands, To explore the UNIX file system, use basic UNIX co...

To explore the UNIX file system, use basic UNIX commands and use a text editor. Task:   1.      Logon to Linux. 2.      Create a directory "Unix" under your home d

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Hj, scheduling

scheduling

Computer number systems, Binary number based systems   Binary is a  ' base...

Binary number based systems   Binary is a  ' base 2' number system, only two numbers exist namely '0' and '1'. Conversion from binary to base 10 is easy if the number column techn

Explain lru enhanced second chance algorithm, Enhanced Second chance algori...

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

Implementation of lru, 1. On every access, mark the page with a timestamp. ...

1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd