I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
1995, VOLUME 1, NUMBER 3, PAGES 805-807
An algorithm to recognize the finite definability of an automatic monomial algebra is obtained.
All articles are published in Russian.
|Main page||Editorial board|
|Instructions to authors||Contents of the journal|
Last modified: September 30, 2001.