Detail publikace

On Operations over Language Families

MEDUNA, A. KRČMÁŘ, R. KÖVÁRI, A. BENÍČKOVÁ, Z.

Originální název

On Operations over Language Families

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

Let O and F be an operation and a language family, respectively. So far, in terms of closure properties, the classical language theory has only investigated whether O(F) is strictly included in F, where O(F) is the family resulting from O applied to all members of F. If O(F) is strictly included F, F is closed under O; otherwise, it is not. This paper proposes a finer and wider approach to this investigation. Indeed, it studies almost all possible set-based relations between F and O(F), including O(F) = empty set; F is not a subset of O(F), O(F) is not a subset of F, F intersection O(F) is not empty set; F intersection O(F) = empty set, O(F) is not empty set; O(F) = F; and F is a subset of O(F).  Many operations are studied in this way. A sketch of application perspectives and open problems closes the paper.

Klíčová slova

language operations, language families, closure properties, finer approach, new trend, set theory

Autoři

MEDUNA, A.; KRČMÁŘ, R.; KÖVÁRI, A.; BENÍČKOVÁ, Z.

Vydáno

21. 12. 2019

ISSN

1561-4042

Periodikum

Computer Science Journal of Moldova

Ročník

27

Číslo

3

Stát

Moldavská republika

Strany od

255

Strany do

282

Strany počet

28

URL

http://www.math.md/files/csjm/v27-n3/v27-n3-(pp255-282).pdf

BibTex

@article{BUT161839,
  author="Alexandr {Meduna} and Radim {Krčmář} and Adam {Kövári} and Zuzana {Beníčková}",
  title="On Operations over Language Families",
  journal="Computer Science Journal of Moldova",
  year="2019",
  volume="27",
  number="3",
  pages="255--282",
  issn="1561-4042",
  url="http://www.math.md/files/csjm/v27-n3/v27-n3-(pp255-282).pdf"
}