RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 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

Abstract: An algorithm to recognize the finite definability of an automatic monomial algebra is obtained.

UDC: 512.55

Received: 01.01.1995



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025