Scribd
Upload
8 views9 pages

Theory of Computation 11

The document discusses the concept of strings in the Theory of Computation, defining a string as a finite sequence of symbols from an alphabet. It covers various topics including the definition of an alphabet, the length of strings, types of strings, common string operations, and the relationship between languages and strings. Additionally, it addresses closure properties of languages under operations like union, concatenation, and Kleene star.

Uploaded by

muhammedyanish2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views9 pages

Theory of Computation 11

The document discusses the concept of strings in the Theory of Computation, defining a string as a finite sequence of symbols from an alphabet. It covers various topics including the definition of an alphabet, the length of strings, types of strings, common string operations, and the relationship between languages and strings. Additionally, it addresses closure properties of languages under operations like union, concatenation, and Kleene star.

Uploaded by

muhammedyanish2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Theory of Computation

|Topic : Strings and Its Operation


Introduction

 Define what a string is in the context of Theory of Computation.

 Text: "In automata theory, a string is a finite sequence of


symbols from a given alphabet. Strings are fundamental in
describing languages and operations in computational theory."
Alphabet and Strings
 Define the concept of an alphabet (Σ) and provide examples.

 Explain how strings are formed using symbols from an alphabet.

 "Alphabet (Σ): A finite, non-empty set of symbols."

 "String: A finite sequence of symbols from an alphabet. E.g., if Σ = {a, b}, then
'aabb' is a string over Σ."
Length of a String
Content:
 Define the length of a string, denoted by |w|.
 Provide examples of strings and their lengths.

Text:
 "The length of a string w, denoted as |w|, is the number of symbols in w."
 "Examples: For w = 'abc', |w| = 3. For w = ε (empty string), |ε| = 0."
Types of Strings
Content:
 Define common types of strings: empty string, prefix, suffix, and substring.

Text:
 "Empty String (ε): A string with zero length."
 "Prefix: A substring that occurs at the start. E.g., 'ab' is a prefix of 'abc'."
 "Suffix: A substring that occurs at the end. E.g., 'bc' is a suffix of 'abc'."
 "Substring: Any sequence of symbols within the string. E.g., 'b' is a
substring of abc'."

.
String Operations
Content:
 Discuss common string operations: concatenation, reversal, and repetition.

Text:
 Concatenation: Combining two strings. If w1 = 'abc' and w2 = 'de', then
w1 · w2 ='abcde'.
 Reversal: Reversing the order of symbols in a string. If w = 'abc', then w^R
= 'cba'.
 Repetition: Repeating a string n times. If w = 'a' and n = 3, then w^3 =
'aaa'.
Language and Strings
Content:
 Define a language in terms of strings and an alphabet.

Text:
 "A language (L) is a set of strings formed from an alphabet Σ."
 "Example: If Σ = {0, 1}, a language could be L = {ε, 0, 1, 00, 01}."
Closure Properties of Strings
 Languages are closed under union, concatenation, and Kleene star.
 "Union: L1 ∪ L2 contains all strings from both L1 and L2."
 "Concatenation: L1 · L2 contains strings formed by concatenating strings
from L1 and L2."
 "Kleene Star (L*): The set of all possible concatenations of strings from L,
including ε."

.
SUBMITTED BY
MUHAMMAD YANEESH K
3RD BCA
9

You might also like