Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
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


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 1982, Number 9, Pages 67–69 (Mi ivm6882)  
Brief communications

Metrization criterion for regularity of languages representable in countable automata

F. M. Ablayev
Full-text PDF (297 kB)
Received: 20.11.1981
Bibliographic databases:
Document Type: Article
UDC: 519.68
Language: Russian
Citation: F. M. Ablayev, “Metrization criterion for regularity of languages representable in countable automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 9, 67–69
Citation in format AMSBIB
\Bibitem{Abl82}
\by F.~M.~Ablayev
\paper Metrization criterion for regularity of languages representable in countable automata
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 1982
\issue 9
\pages 67--69
\mathnet{http://mi.mathnet.ru/ivm6882}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0676916}
\zmath{https://zbmath.org/?q=an:0531.68012}
Linking options:
  • https://www.mathnet.ru/eng/ivm6882
  • https://www.mathnet.ru/eng/ivm/y1982/i9/p67
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:260
    Full-text PDF :97
    References:4
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025