O'Reilly logo

Express Learning: Automata Theory and Formal Languages by Shyamalendu Kandar

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

2

Language and Grammar

2.1 BASIC TERMINOLOGY AND DEFINITIONS

Q. Define symbol, alphabet and string.

Ans. Symbol: A symbol is a user-defined entity.

Alphabet: An alphabet is a finite set of symbols denoted by Σ in automata. Alphabets are a set of symbols used to construct a language. Example, {0, 1} is binary alphabet, {A…, Z, a…z} is the alphabet set for the English language.

String: A string is defined as a sequence of symbols of finite length. A string is denoted by w in automata. Example, 000111 is a binary string.

(Length of a string w is denoted by |w|. For the previous case, |w| = |000111| = 6).

Q. Define Prefix, proper Prefix, Suffix, proper Suffix, and substring in relation to a string.

Ans. Prefix: The prefix of a string is the string ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required