All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On Operations over Language Families

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU135162" target="_blank" >RIV/00216305:26230/19:PU135162 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.math.md/files/csjm/v27-n3/v27-n3-(pp255-282).pdf" target="_blank" >http://www.math.md/files/csjm/v27-n3/v27-n3-(pp255-282).pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Operations over Language Families

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computer Science Journal of Moldova

  • ISSN

    1561-4042

  • e-ISSN

  • Volume of the periodical

    27

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    MD - MOLDOVA, REPUBLIC OF

  • Number of pages

    28

  • Pages from-to

    255-282

  • UT code for WoS article

    000504036200001

  • EID of the result in the Scopus database

    2-s2.0-85088259462