Issledovaniya po Prikladnoi Matematike
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Issled. Prikl. Mat. Inform.:
Year:
Volume:
Issue:
Page:
Find




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

Issledovaniya po Prikladnoi Matematike, 1992, Issue 20, Pages 13–17 (Mi kuipm3)  
On the algorithmic recognition of the codability property of infinite languages

N. Z. Gabbasov
Full-text PDF (499 kB)
English version:
Journal of Mathematical Sciences, 1995, Volume 74, Issue 6, Pages 1303–1305
DOI: https://doi.org/10.1007/BF02367716
Bibliographic databases:
Language: Russian
Citation: N. Z. Gabbasov, “On the algorithmic recognition of the codability property of infinite languages”, Issled. Prikl. Mat., 20, Kazan University, Kazan, 1992, 13–17; J. Math. Sci., 74:6 (1995), 1303–1305
Citation in format AMSBIB
\Bibitem{Gab92}
\by N.~Z.~Gabbasov
\paper On the algorithmic recognition of the codability property of infinite languages
\serial Issled. Prikl. Mat.
\yr 1992
\vol 20
\pages 13--17
\publ Kazan University
\publaddr Kazan
\mathnet{http://mi.mathnet.ru/kuipm3}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1290463}
\zmath{https://zbmath.org/?q=an:0844.68072}
\transl
\jour J. Math. Sci.
\yr 1995
\vol 74
\issue 6
\pages 1303--1305
\crossref{https://doi.org/10.1007/BF02367716}
Linking options:
  • https://www.mathnet.ru/eng/kuipm3
  • https://www.mathnet.ru/eng/kuipm/v20/p13
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:158
    Full-text PDF :91
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024