Publication detail

On Operations over Language Families

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

Original Title

On Operations over Language Families

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

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

Authors

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

Released

21. 12. 2019

ISBN

1561-4042

Periodical

Computer Science Journal of Moldova

Year of study

27

Number

3

State

Republic of Moldova

Pages from

255

Pages to

282

Pages count

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"
}