Publication detail

To some structural properties of ∞-languages

MEZNÍK, I.

Original Title

To some structural properties of ∞-languages

Type

journal article - other

Language

English

Original Abstract

Properties of catenation of sequences of finite (words) and infinite (𝜔-words) lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices. Finite automata accept structures containing only words, 𝜔-automata accept only 𝜔-words. Structures containing both words and 𝜔-words (∞-words) are mostly generated by various types of ∞-automata (∞-machines). The aim of the paper is to investigate algebraic properties of operations on ∞-words generated by IGk-automata, where k is to model the depth of memory. It has importance in many applications (shift registers, discrete systems with memory...). It is shown that resulting algebraic structures are of „pure“ groupoid or partial groupoid type.

Keywords

∞-words; ∞-language; ρn,p,r-catenation; closure of an ∞-language; ρ-operation

Authors

MEZNÍK, I.

Released

1. 7. 2022

ISBN

1592-7415

Periodical

Ratio Mathematica

Year of study

42

Number

1

State

Republic of Italy

Pages from

127

Pages to

134

Pages count

8

URL

http://eiris.it/ojs/index.php/ratiomathematica/issue/view/96

BibTex

@article{BUT179126,
  author="Ivan {Mezník}",
  title="To some structural properties of ∞-languages",
  journal="Ratio Mathematica",
  year="2022",
  volume="42",
  number="1",
  pages="127--134",
  issn="1592-7415",
  url="http://eiris.it/ojs/index.php/ratiomathematica/issue/view/96"
}