Fundamentalnaya i Prikladnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Journal history

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Fundamentalnaya i Prikladnaya Matematika, 1995, Volume 1, Issue 3, Pages 805–807 (Mi fpm97)  
Short communications

Recognition of definability of automata monomial algebras

E. V. Lukoyanova

Ul'yanovsk Branch of M. V. Lomonosov Moscow State University
Full-text PDF (164 kB)
References:
PDF
HTML
Abstract: An algorithm to recognize the finite definability of an automatic monomial algebra is obtained.
Received: 01.01.1995
Bibliographic databases:
Document Type: Article
UDC: 512.55
Language: Russian
Citation: E. V. Lukoyanova, “Recognition of definability of automata monomial algebras”, Fundam. Prikl. Mat., 1:3 (1995), 805–807
Citation in format AMSBIB
\Bibitem{Luk95}
\by E.~V.~Lukoyanova
\paper Recognition of definability of automata monomial algebras
\jour Fundam. Prikl. Mat.
\yr 1995
\vol 1
\issue 3
\pages 805--807
\mathnet{http://mi.mathnet.ru/fpm97}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1788558}
\zmath{https://zbmath.org/?q=an:0866.68055}
Linking options:
  • https://www.mathnet.ru/eng/fpm97
  • https://www.mathnet.ru/eng/fpm/v1/i3/p805
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Фундаментальная и прикладная математика
    Statistics & downloads:
    Abstract page:255
    Full-text PDF :97
    References:33
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024