RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 1998, Volume 10, Issue 2, Pages 128–136 (Mi dm420)  

This article is cited in 5 scientific papers (total in 5 papers)

On Slupecki classes for deterministic functions

S. S. Marchenkov


Abstract: It is proved that the cardinality of the family of Słupecki classes in the class of all finite-automaton functions is continual, and in the class of all automaton functions it is hypercontinual.
This work is supported by the Russian Foundation for Basic Research, grant 93–01–16006.

DOI: https://doi.org/10.4213/dm420

Full text: PDF file (973 kB)

English version:
Discrete Mathematics and Applications, 1998, 8:3, 299–307

Bibliographic databases:

UDC: 519.716
Received: 09.03.1995

Citation: S. S. Marchenkov, “On Slupecki classes for deterministic functions”, Diskr. Mat., 10:2 (1998), 128–136; Discrete Math. Appl., 8:3 (1998), 299–307

Citation in format AMSBIB
\Bibitem{Mar98}
\by S.~S.~Marchenkov
\paper On Slupecki classes for deterministic functions
\jour Diskr. Mat.
\yr 1998
\vol 10
\issue 2
\pages 128--136
\mathnet{http://mi.mathnet.ru/dm420}
\crossref{https://doi.org/10.4213/dm420}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1673107}
\zmath{https://zbmath.org/?q=an:0965.03054}
\transl
\jour Discrete Math. Appl.
\yr 1998
\vol 8
\issue 3
\pages 299--307


Linking options:
  • http://mi.mathnet.ru/eng/dm420
  • https://doi.org/10.4213/dm420
  • http://mi.mathnet.ru/eng/dm/v10/i2/p128

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. S. S. Marchenkov, “Functional aspects of the completeness problem for some classes of automaton functions”, Discrete Math. Appl., 10:3 (2000), 279–294  mathnet  crossref  mathscinet  zmath
    2. V. A. Buevich, “The completeness criterion for systems containing all one-place bounded-determinate functions”, Discrete Math. Appl., 10:6 (2000), 613–634  mathnet  crossref  mathscinet  zmath
    3. S. S. Marchenkov, “O chisle maksimalnykh podgrupp v gruppakh avtomatnykh podstanovok”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 11:2 (2004), 73–79  mathnet  mathscinet  zmath
    4. S. S. Marchenkov, “On the Cardinality of the Family of Precomplete Classes in $P_E$”, Math. Notes, 78:6 (2005), 801–806  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    5. A. A. Rodin, “Some properties of $P$-sets of finite-automaton functions”, Moscow University Mathematics Bulletin, 68:1 (2013), 71–73  mathnet  crossref
  • Дискретная математика
    Number of views:
    This page:492
    Full text:150
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019