<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. MML identifier: FLANG 1 , version: 7.8.04 4.81.962</p></abstract>

Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. MML identifier: FLANG 1 , version: 7.8.04 4.81.962

Formal Languages - Concatenation and Closure

Formalized Mathematics

{"article-title":"Formal Languages - Concatenation and Closure"}

Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and...

Formal Languages - Concatenation and Closure

Data publikacji: 13 cze 2008

Zakres stron: 11 - 15

DOI: https://doi.org/10.2478/v10037-007-0002-y

This content is open access.